KR20180108371A - Method for generating a sequence for a pola code and medium therefor and method and apparatus for transmitting data using thereof - Google Patents

Abstract

The present invention relates to a method and an apparatus for encoding data to be transmitted in a communications system. In particular, the present invention provides a method and an apparatus for generating a sequence for a polar code for use in a communications system, and a method and an apparatus for transmitting data using the same. The method for generating a sequence for polar code according to an embodiment of the present invention comprises the steps of: designing each optimized polar code sequence with respect to a plurality of code rates for polar coding; sequentially arranging bit channels indexes from a bit channel index having the worst channel state to a bit channel index having the best channel state for each code rate in a descending order sequence; and generating a sequence for polar encoding by inserting a bit channel index, which is selected for data transmission in an order sequence from the lowest code rate to the height code rate among the code rates, into a final bit channel index sequence. When a bit channel index selected from each code rate for transmission is inserted into the final bit channel index sequence, the remaining bit channel indexes excluding a bit channel index at the same position as the bit channel index previously inserted into the final bit channel index sequence may be sequentially inserted into the lower portion of the previously inserted bit channel index.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for generating a sequence for a polar sign, a storage medium, and a method and apparatus for transmitting data using the same. 2. Description of the Related Art Generally,

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and apparatus for encoding data to be transmitted in a communication system, and more particularly, to a method and apparatus for generating a sequence for a polarity code for use in a communication system and a method and apparatus for transmitting data using the same.

Generally, when a communication system transmits and receives data between a transmitter and a receiver, a data error may occur due to noise existing in the communication channel. The error correction coding scheme is a coding scheme designed to correct an error generated by a communication channel in the receiver. These error correction codes are also referred to as channel coding. The error correction coding technique is a technique for transmitting redundancy bits to data to be transmitted and transmitting the redundancy bits.

There are various schemes for error correction coding. For example, convolutional coding, turbo coding, LDPC coding, and polar coding are available. Among these error correction coding schemes, the polar code scheme is the first theoretically proven code to achieve point-to-point channel capacity using channel polarization. The polarity codes can be optimized for each channel or code rate with density evolution and RCA (Reciprocal Channel Approximation). However, in order to apply the polar coding scheme in an actual communication system, it is necessary to have an index sequence optimized for each coding rate. Having such an index sequence in advance has a problem of increasing memory complexity.

On the other hand, the 5th generation (5G) mobile communication technology, which has recently been proposed as a next generation mobile communication system, mainly refers to the following three scenarios. First, Enhanced Mobile Broadband (eMBB), Ultra-Reliable and Low Latency Communication (URLLC), and Massive Machine Type Communication (mMTC). Error correction codes to support various schemes should support various coding rates with stable performance.

However, until now, there has not yet been a way to satisfy all of these various methods while not increasing the memory complexity.

Therefore, it is an object of the present invention to provide a polar code designing method that supports various scenarios of an actual 5G mobile communication technology by designing a pole code supporting various coding rates with a performance optimized for each channel by a single index sequence, And methods.

It is another object of the present invention to provide an apparatus and method for transmitting data using a polar code designing method and a designed method which can have high performance even at various coding rates and can reduce complexity.

It is another object of the present invention to provide a method of designing a single index sequence capable of supporting code rate compatibility with a small performance degradation in practical application of polar codes, and an apparatus and method for transmitting data using the same.

A method according to an embodiment of the present invention includes: designing each optimized polar sign sequence for a plurality of code rates for polar coding; Sequentially arranging from a bit channel index having the worst channel state to a bit channel index having the best channel state for each of the plurality of code rates in a descending sequence; And generating a sequence for polar coding by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence,

And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted And sequentially inserted into the lower bit channel index.

An apparatus according to an embodiment of the present invention includes a transceiver for transmitting / receiving data encoded in a polar coding scheme through a wireless channel band in a communication system, A memory for storing a polar encoding sequence; A polarizer for polarizing the data to be transmitted using the polar encoding sequence stored in the memory; And determining a code rate and a target error rate of the data to be transmitted, a code rate of a polarity code and a target error rate, and determining a polarity encoding sequence corresponding to the determined length of the data to be transmitted, the code rate of the polarity code and the target error rate, And a control unit for controlling the polar encoding using the selected polarizing sequence and controlling transmission of the polarized encoded data,

Wherein the polar encoding sequence stored in the memory is:

Designing each optimized polarity code sequence for a plurality of code rates for a plurality of code rates, and for each of the plurality of code rates, from a bit channel index having the worst channel state to a bit channel index having the best channel state And a sequence for polar coding is generated by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence, ,

And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted And a sequence generated by sequentially inserting the bitstream indexes under the bitstream indexes.

A method according to an embodiment of the present invention is a method for transmitting data in a polarity encoding method in a communication system and includes determining a length of data to be transmitted and a code rate and a target error rate of a polarity code when a predetermined data transmission is requested step; Selecting a polar encoding sequence corresponding to the determined length of data to be transmitted, a code rate of a polarity code and a target error rate; Performing polar coding using the selected polarizing sequence; And transmitting the polar-encoded data,

Wherein the polar encoding sequence comprises:

Designing each optimized polarity code sequence for a plurality of code rates for a plurality of code rates, and for each of the plurality of code rates, from a bit channel index having the worst channel state to a bit channel index having the best channel state And a sequence for polar coding is generated by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence, ,

And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted Which is generated by sequentially inserting the bitstream indexes under the bitstream indexes.

According to the present invention, it is possible to support various scenarios of an actual 5G mobile communication technology by designing a polar code supporting various coding rates with a performance optimized for each channel by a single index sequence. Also, it can have high performance at various code rates and can reduce the complexity.

FIGS. 1A to 1C are conceptual diagrams illustrating a process of designing an optimized sequence at a specific code rate for explaining the present invention.
2 is a conceptual diagram for explaining a method of designing a single polar code sequence according to an embodiment of the present invention.
3 is a flow chart for generating a single polar code sequence according to an embodiment of the present invention.
4A and 4B are conceptual diagrams for explaining a code designing method according to an embodiment of the present invention.
FIG. 5 is a conceptual diagram illustrating a sequence for generating sequences of different lengths according to the present invention.
6 is a flowchart of a single code sequence designing method according to the present invention.
7 is a conceptual block diagram of a transmitting apparatus for applying the polar coding scheme according to the present invention.
8 is a control flowchart for performing polar coding in data transmission in a transmitting apparatus according to an embodiment of the present invention.
FIGS. 9A and 9B are graphs of a comparison simulation in the case of applying the polar coding method of the present invention and the case of using the polar coding method having the simple polynomial described in the description of the present invention.

Hereinafter, various embodiments will be described in detail with reference to the accompanying drawings. Note that, in the drawings, the same components are denoted by the same reference symbols as possible. It should be noted that the drawings of the present invention attached hereto are provided for the purpose of helping understanding of the present invention, and the present invention is not limited to the shape or arrangement exemplified in the drawings of the present invention. Further, the detailed description of well-known functions and constructions that may obscure the gist of the present invention will be omitted. In the following description, only parts necessary for understanding the operation according to various embodiments of the present invention will be described, and the description of other parts will be omitted so as not to obscure the gist of the present invention.

Prior to describing the present invention, a more detailed description will be given of the known polarity coding methods to date.

First, it is important to design a single index sequence that can support code rate compatibility with various performance degradation for various channels, that is, various code rates, in practical application of the polarity code. A method of generating an optimized index sequence through a density evolution method for various code rates using a current polarity coding scheme is known. To use the density evolution method, an optimized design considering each channel environment is required in order to obtain the best performance in each channel.

와 같이 표현할 때,

이고, 'B_i=0'는 채널의 양극화 과정에서 채널의 저하(degradation)를 의미하고, 'B_i=1'은 채널의 향상 (upgradation)을 의미한다. 따라서 이러한 조건을 갖는 각 채널 인덱스의 신뢰도는 하기 <수학식 1>과 같이 계산될 수 있다.One of the ways to solve this coding rate compatibility problem is to design code that does not use existing density evolution methods. The code design method that does not use the density evolution method evaluates the reliability of each channel by using a simple polynomial using the binary representation of the index instead of measuring the channel reliability by the density evolution method when selecting the channel index to transmit the information bits . In order to express this as a mathematical expression,

When expressed as,

'B _i = 0' means channel degradation during the polarization of the channel, and 'B _i = 1' means upgradation of the channel. Therefore, the reliability of each channel index having such a condition can be calculated as Equation (1) below.

For example, when the reliability of the index i = 7 (0111) at the code length n = 4 is measured, the reliability is calculated as follows.

를 오름차순으로 정렬한다. 이때, 각 채널의 신뢰도가

와 같이 정의되면, 오름차순으로 정렬된 결과는

와 같다. 이와 같이 정렬된 스퀀스들에서 인덱스 시퀀스

가 부호 설계를 위한 단일 인덱스 시퀀스가 된다.As shown in Equation (2), the reliability of each channel can be calculated through a simple polynomial, and the reliability of each channel

In ascending order. At this time, the reliability of each channel

, The result sorted in ascending order is

. In such ordered sequences, the index sequence

Becomes a single index sequence for code design.

On the other hand, as described above, it is inefficient in terms of memory complexity to store and use each optimized index sequence to support various coding rates in various scenarios of the 5G (5G) mobile communication technology. In order to solve the problem of the polar sign, there is a technique of generating a single index sequence by measuring the reliability of each channel by a simple polynomial method and aligning them by the proposed polar code design method. However, the code designed using a simple polynomial is not optimized for each channel, and thus the best performance can not be obtained at each code rate. Therefore, a simple polynomial scheme can design a code with various coding rates without serious performance degradation, but there is a definite limitation in designing a code having optimal performance in each channel.

Therefore, in the present invention described below, the present invention uses a single index sequence design method and a single index sequence design method designed to obtain the best performance at each code rate based on an optimized index sequence using density evolution at each code rate An apparatus and a method for use will be described.

The important point of the invention is that by using the inclusion relation of the information set having a subset of the information bits of the optimized code in each channel, the optimized information set for each code rate is included in the single index sequence, So that the best performance can be achieved.

FIGS. 1A to 1C are conceptual diagrams illustrating a process of designing an optimized sequence at a specific code rate for explaining the present invention.

First, referring to FIG. 1A, indexes may be assigned to all channels available in a corresponding communication system for a specific code rate R ₁ . For example, assuming that there are N available channels 100 and 1 index for each channel, 1, 2, 3, 4, 5, 6, 7, ... , And N indexes such as N can be given. A usable channel 1 is denoted by reference numeral 101, a usable channel 2 is denoted by reference numeral 102, a usable channel 3 is denoted by reference numeral 103, a usable channel 4 is denoted by reference numeral 104, Channel 5 is denoted by reference numeral 105, available channel 6 is denoted by reference numeral 106, and usable channel 7 is denoted by reference numeral 107. [

At this time, the error rate for each channel can be calculated using a density evolution technique or another optimization method at a specific polar code rate R ₁ . It is possible to generate an optimized bit channel index sequence by aligning the channel indexes in descending order of the good channel to the bad channel according to the channel state using the error rate calculated for each channel at the set coding rate R ₁ . In the example of FIG. 1A, a good channel and a bad channel have a sequence of bit channel index sequences in the same order as the order of indexes of usable channel indexes 100. However, it is apparent to those skilled in the art that in actual situations, channel indexes usable in a form different from that illustrated in FIG. 1A can be listed in order from a good channel to a bad channel. For example, in the actual situation, "6, m-5, 3, m + 2, 4, N, 2, ..." in the case of listing the bit channel index sequence in a good channel to a bad channel order for each channel at a specific code rate R ₁ , . &Lt; / RTI &gt; Where m is an integer greater than 1 and less than N.

Here, the meaning used in the present specification for a good channel and a bad channel will be described. The meaning of the channel performance of the bits in the polar sign is that the quality of the polarized sub-channel that each bit undergoes after the channel polarization of the polar sign is superior and the bit error rate of the corresponding bit is low The meaning can be c. In this specification, each bit index of each bit and sequence of the polar sign is referred to as a channel. These channels all refer to the differentiation-channel of the polar sign. Therefore, the channel referred to in this specification may have a different meaning from a generally used physical channel (a channel through which an actual signal is transmitted). When encoded / decoded by the polar sign, the channel capacity of each bit is changed. The specific bit has a capacity of 1, and the specific bit has a capacity of 0. Therefore, bits with high cpacity are called good subchannels or good channels in the following description, and bits with low capacity are referred to as bad subchannels or bad channels.

Also, in the example of FIG. 1A, the available channel 1, which is the first good channel for each of the bit channel indexes from the good channel to the bad channel for each channel at a specific coding rate R ₁ , is denoted by reference numeral 111, The usable channel 2 is denoted by reference numeral 112, the usable channel 3, which is the third good channel, is denoted by reference numeral 113, the usable channel 4, which is the fourth good channel, is denoted by reference numeral 114, The usable channel 5 is denoted by reference numeral 115, the usable channel 6, which is the sixth good channel, is denoted by reference numeral 116, and the usable channel 7, which is the seventh good channel, is denoted by reference numeral 117. In the following description, an optimized bit channel index sequence in which channel indexes are arranged in descending order of good channel to bad channel according to the channel state using the error rate calculated for each channel at a specific code rate R ₁ is denoted as S ₁ 110 Quot;

Also, in FIG. 1A, the reference numbers are changed at the coding rate with respect to the respective channel indexes in order to explain how the channel index numbers change according to the respective coding rates.

Next, referring to FIG. 1B, an optimized bit channel index sequence in which channel indexes are arranged in descending order of channel to bad channel according to the channel state using the error rate calculated for each channel at another specific coding rate R ₂ Let's look at S ₂ 120.

Looking at FIG. In contrast to Figure 1a to 1b, the code rate is changed from R ₁ to R _2, the optimized bit channel index sequence can be confirmed that the first channel is changed to the bit index sequence S ₂ S ₁ on the optimization. Also, it can be recognized that the order of the optimized bit channel index S ₁ and the channel index at the code rate R ₁ is changed in the bit channel index sequence S ₂ optimized at the code rate R ₂ . That is, the channel index 1 121, which is the best channel at the code rate R ₂ , the channel index 2 122 which is the second good channel, and the third channel index 3 123, which are the same at the code rate R ₁ and at the code rate R ₂ , I have. On the other hand, the code rate good channel index 5124 in R _2, the fourth has a fourth good channel index 4114 and a different index in a code rate R _1. In addition, the fifth good channel index 4125 as in the code rate R ₂ has the fifth best channel index 5115 and a different index in a code rate R _1.

FIGS. 1A and 1B are diagrams for explaining that optimized channel indices at the respective coding rates may be the same or different. As a result, if the code rate is changed, it means that the optimized bit channel index sequence can be changed.

Therefore, as illustrated in Figure 1c when the T code rate used by the particular communication system, it is possible to calculate the optimized bit channel index sequence S ₁ 110 at a code rate R _1, optimized bit channel at a code rate R ₂ The index sequence S ₂ 120 can be calculated and the optimized bit channel index sequence S _T 140 at the code rate R _T can be calculated.

In the present invention, the optimized bit channel index sequences S ₁ 110, S ₂ 120, ... , And S _T 140 can be used to obtain a bit channel index sequence to be applied to the final polarity coding scheme that can be used at all coding rates.

The present invention, the T of a code rate used in a communication system _{"{R 1, R 2,} ..., R T}""{S 1, S 2, ..., S T}" , which are optimized bit channel index sequence to the To generate an optimized final bit channel index sequence Q 200 for use in practice. Here, the code rate R _i = k _i / N and k _i denotes the number of channels used for data transmission among N bit channels. Since channels with low error rates are used for data transmission with respect to each code rate, data channels are sequentially arranged from the top channel index of each sequence.

1, one data channel is selected when "k ₁ = 1" for the code rate R ₁ , and "k ₂ = 4" for the code rate R ₂ as in the example of FIG. 1B Four data channels are selected. In the following description, the set of channel indexes selected by the data channel as above is referred to as an " information set &quot;, and an information set for each code rate is denoted by A _i . The information sets at each coding rate selected according to the scheme of FIGS. 1A and 1B are A ₁ = {1} and A ₂ = {1, 2, 3, 5}.

Then, a description will be given of how to design the optimized final bit channel index sequence Q 200 to be finally designed using the T sequences described above.

As described above, {R ₁ , R ₂ , ... , R _T } is designed to be optimal for each code rate. Before explaining the code designing method, the features of the sequence designed through the designing method of the present invention will be briefly divided into two cases.

The first case is {R ₁ , R ₂ , ... , R _T } are appropriately set, and the relation of A ₁ ⊂ A ₂ ⊂ ?? ⊂ A _T is established. Hereinafter, the present invention will be described with reference to FIG.

2 is a conceptual diagram for explaining a method of designing a single polar code sequence according to an embodiment of the present invention.

Optimized bit channel at 2, the coding rate R _1, if an optimized bit channel index sequence with S ₁ 110 is designed at a code rate R ₁ and the information set A ₁ 1101, code rate R in the _two If the index sequence S ₂ 120 is designed and the information set a ₂ 1201 at the code rate R _2, if an optimized bit channel index sequence in the code rate R ₃ with S ₃ 130 is designed in a code rate of R ₃ and the information set a ₃ 1301, a code rate optimized bit channel index in the sequence R _T S _T 140 is a code rate R _{T T} a set of information 1401 in a case that is designed.

)의 인덱스들은 S₂의 순서에 따라 최적화된 최종 비트 채널 인덱스 시퀀스 Q 200에 매핑시킨다. 만약 최적화된 최종 비트 채널 인덱스 시퀀스 Q 200을 통해 지원하고자 하는 부호율이 오직 {R₁, R₂, …, R_T}이면, A₁, A₂-A₁, A₃-A₂, …의 각 집합 안에서의 인덱스 순서는 오류율 성능에 아무런 영향을 주지 않는다. 마찬가지로 R₁보다 작은 부호율과 R_T보다 큰 부호율에 대한 시퀀스 순서는 임의로 변경되어도 무방하다. 그러나 {R₁, R₂, …, R_T} 이외의 부호율을 지원하게 되는 경우 A₁, A₂-A₁, A₃-A₂, …의 인덱스 순서에 따라 오류율 성능이 달라진다.At this time, when the T value is made smaller, that is, when the code rate interval in which each sequence is designed is large, the inclusion relation between the information sets can be established as described above. In this case, as shown in FIG. 2, A ₁ , A ₂ -A ₁ , A ₃ -A ₂ , ... , The sequence can be designed in such a manner that it enters the final bit channel index sequence Q 200, which is optimized in order. The index of A ₁ and are mapped to the last bit Q channel index sequence 200 optimized in the order of S _1, A ₂ \A ₁ (wherein A ₁ is ₂ \A

) Are mapped to the final bit channel index sequence Q 200 optimized in the order of S ₂ . If the code rate to be supported through the optimized final bit channel index sequence Q 200 is only {R ₁ , R ₂ , ... , R _T }, A ₁ , A ₂ -A ₁ , A ₃ -A ₂ , ... The index order within each set of bits has no effect on error rate performance. Likewise, the sequence order for a code rate smaller than R ₁ and a code rate larger than R _T may be arbitrarily changed. However, {R ₁ , R ₂ , ... , R _T }, A ₁ , A ₂ -A ₁ , A ₃ -A ₂ ,. The error rate performance is changed according to the index order of the error rate.

Therefore, in order to design the final bit channel index sequence Q 200 optimized for a higher code rate, the optimized final bit channel index sequence Q 200 must be designed by increasing the T value. If the T value is increased as described above, there is a high possibility that the inclusion relation between the information sets is not established. Therefore, the second case is the case where the information set inclusion relation described above does not hold. In this case, the last optimized bit channel index sequence Q 200 is finally generated in consideration of the influence of each channel index on the coding performance of all coding rates (or partial coding rates). Concretely, the influence of each index on the coding performance of each coding rate will be referred to as " penalty " hereinafter.

Prior to describing the code designing method according to the second method of the present invention, the penalty W _j for the bit index j can be defined as Equation (3).

<Equation 3> P _i (E _j) is the sequence and the error rate of the index j from the _{S i, P i (E worst} ) is set and does not contain an index to the last bit channel index sequence Q 200 the current optimization A _i set Is the lowest error rate for the index belonging to the intersection. And α _i is a parameter reflecting the importance according to the coding rate. For example, if all code rates have the same significance, the values of all α _i can be set to the same value, and if the code rate i is more important than the code rate i ', then α _i' <α _i .

는 비트 인덱스 j가 부호율 R_i의 부호에 미치는 성능 손실을 의미하는데, 항상 0혹은 그 이상의 값을 갖고, 그 값이 클수록 성능 열화가 큰 것을 의미한다. 따라서 페널티 W_j는 비트 인덱스 j가 모든 부호율의 부호에 미치는 성능 손실을 나타내는 파라미터가 된다. 하지만, 페널티를 정의하는 방법은 다양하게 존재할 수 있다. 예를 들어 합계가 아닌 최대 값만을 취하는 연산 등이 사용될 수 있다. 예를 들어 하기 <수학식 4>와 같이 표현하는 것도 가능하다.In Equation (3), the operation of &quot; {·} ⁺ &quot; is an operator that outputs the value as it is when the value in {} is positive and outputs as 0 when it is negative. That is, in Equation (3)

Means the performance loss of the bit index j on the sign of the code rate R _i . It always has a value of 0 or more, and the larger the value, the larger the performance deterioration. Therefore, the penalty W _j is a parameter indicating the performance loss of the bit index j on the code of all the code rates. However, there are various ways of defining the penalty. For example, an operation that takes only a maximum value but not a sum may be used. For example, Equation (4) can be expressed as follows.

When a polesignal sequence for T code rates is defined, the final bit channel index sequence Q200 that is finally optimized can be designed by performing the following operation T times using the penalty-related equation defined above.

3 is a flow chart for generating a single polar code sequence according to an embodiment of the present invention.

The value of L is set to 1 in step 300, and it is checked in step 302 whether the L value is larger than a predetermined M value. In this case, M is the number of code lengths to be considered, for example, N = 2 ⁵ , 2 ⁶ , ... , M = 6 when a single sequence for the length of 2 ¹⁰ is designed. In this case, L is an index of each length. In the above example, N = 2 ⁵ has a length index of L = 1 and N = 2 ⁶ has a length index of L = 2. Therefore, when the initial L is set to 1, the L value is smaller than the M value, and therefore, the process proceeds to step 304. Then, in step 304, the code lengths of the index L, i.e., R ₁ , R ₂ , ... , Well-bit channel index sequence optimized for a _{R T {S 1, S 2} , ... , S _T } can be designed first. Then, in step 306, i is set to 1, and in step 308, it is determined whether i is greater than T. A value of i greater than T means that the processing of the polar sign sequences for all code rates is complete. Therefore, the value of i may be greater than 1 and less than or equal to T.

In the case of proceeding from step 308 to step 312, the processing of the polar sign sequences for all the code rates may be completed. Accordingly, if it is determined in step 308 that the processing of the polar sign sequences for all the code rates is not completed, the process proceeds to step 320.

In step 320, the j value is set to 1, and it is determined whether the j value is larger than the N value. Here, N may be a set code length. If j is not greater than N in step 322, the penalty may be calculated using Equation (3) or Equation (4) or the same concept as described above in step 324. That is, the penalty W _j can be calculated at S _i . The operation of step 324 may be performed until the code length is reached. Thereafter, step 324 is performed on all code lengths, and then step 326 is performed. In step 326, the final bit channel index sequence Q 200 optimized based on the calculated W j can be mapped and inserted. At this time, the method of mapping and inserting in the optimized final bit channel index sequence Q 200 is as shown in FIG. 2. In the case of i> 1, the bit channel indexes optimized by selecting the number of | A _i | - | A _{i -1} | Sequence Q 200 can be sequentially inserted. Thereafter, the i value is incremented by 1 and then the process proceeds to step 320.

As described above, if all the processes of the T times are completed, the sequence of the corresponding length can be obtained in step 312. Thereafter, the L value is increased by 1, and then the L value and the M value are compared again. If the L value has been completed by the predetermined length, the process proceeds to step 330 and the final sequence Q can be obtained.

4A and 4B are conceptual diagrams for explaining a code designing method according to an embodiment of the present invention.

Prior to referring to the figures, in the example of FIGS. 4A and 4B, the bit channel index sequences S ₁ , S ₂ , ..., optimized for T code rates, , And S _T are calculated in advance. Also | A1 | = 1, _{and, | A i + 1 | -} | a = 1 is assumed situation | A _i. As described above, the size of each information bit set can be arbitrarily adjusted by adjusting the intervals of the coding rates. | A _{i + 1} | - | A _i | = i, ∀ i = 1, ... , N-1), that is, A ₁ = {1}, A ₂ = {1, 2}, A ₃ = {1, 2, 3}. And α _i = 1.

4A and 4B will be described on the assumption of such a case. In FIGS. 4A and 4B, different reference numerals are used for convenience of description, and reference will be made to FIGS. 4A and 4B.

)이고, 이때 W₁=0이다. First, penalties from W ₁ to W _N can be calculated using S ₁ to S _T. The bit channel index 1 401 is all contained in the information set and is located at the top of all the code rates. Therefore, the value of P _i (E ₁ ) -P _i (E _worst ) is always negative (

), Where W ₁ = 0.

로 페널티가 계산된다. 이때 비트 채널 인덱스 2인 402는 A₂, …, A_N에 모두 포함되어 있다고 가정한다. 이와 유사하게 비트 채널 인덱스 3인 403에 대해서는 S₁과 S₂에 대해 페널티가 계산되어

으로 계산된다. 이와 같은 방식으로 나머지 인덱스들에 대해서도 페널티가 계산되며 항상 0보다 큰 값을 갖게 된다. Next, since the bit channel index 2 402 is not included in the information set of S ₁

Lt; / RTI &gt; At this time, the bit channel index 2 402 is A ₂ , ... , And A _N , respectively. Similarly, for bit channel index 3, 403, a penalty is calculated for S ₁ and S ₂

. In this way, the penalty is calculated for the remaining indices and always has a value greater than zero.

As a result, in the first step, only A1 index = 1 is added to Q, so that bit channel index 1 401 is added to the first position (top) of the polar sign single sequence Q, resulting in Q = (1) .

In the second step, since the set of S ₁ corresponding to the lowest code rate R ₁ is calculated and inserted into the polar polar code single sequence Q, the penalty is calculated from S ₂ to S _T. At this time, since the channel bit index 1 401 is inserted in the already-polar polar code single sequence Q, the penalty W ₂ to W _N from 402 to N, which is the channel bit index 2 excluding 401 which is the channel bit index 1, is calculated. As in the first step, if channel bit index 402 is included in all information sets from S ₂ to S _T except S ₁ , then W ₂ = 0. Since the channel bit index 3 403 is not included in the information set at S ₂ , it has a penalty greater than zero. And the remaining channel bit indices and the penalty are both positive, the channel bit index 402, which is the channel bit index 2, is included in the polar polar code single sequence Q. [ As a result, the value of (1, 2) is set for the single pole Q sequence Q considering the second step S ₂ .

In the same manner as above, assume that 3 and 5 are included in the polar polar code single sequence Q in the third and fourth steps, respectively, and Q = (1, 2, 3, 5). In the fifth step, the penalty for each index can be calculated using S ₅ to S _T for the other indices except (1, 2, 3, ₅ ).

Referring to FIG. 4B, assuming that the bit channel index 4 is included in the information set from S ₈ to S _T , the penalty is calculated so that W ₄ = {P ₆ (E ₄ ) -P ₆ (E ₇ )}} do. The bit channel index 4 is excluded because only information on the set S ₆ is calculated only penalty in S _6. At this time, the penalty value of the bit channel index 4, which is not included in the single sequence Q among the bit channel indexes included in the information set of S ₆ , and the error rate difference with the index 417 having the highest error rate, is calculated.

The penalty for the bit channel index 7 is calculated as W ₇ = {P ₅ (E ₇ ) -P ₅ (E ₄ )} + {P ₇ (E ₇ ) -P ₇ (E ₈ ) The penalty at S ₇ is P ₇ (E ₇ ) -P ₇ (E ₈ ). This is because the index with the highest bit error rate is 5 in the information set of S ₇ , but the current 5 is already included in the Q-set, so it is not considered in the penalty calculation. In this way, an index having the lowest penalty value among the bit channel indexes not previously included in a single sequence Q is added as a fifth index to a single sequence Q, and this method is repeated T times to finally obtain a single polar code sequence Q can be generated.

In the above, a method of designing a sequence for each length has been described. That is, if the length N is 2 ⁵ , 2 ⁶ , 2 ⁷ , ... A method of designing a sequence having a different length is described.

A method of designing a long sequence of single sequences for use in various lengths will now be described using a method of designing sequences (N = 2 ⁵ , 2 ⁶ , 2 ⁷ , ...)

For example, if the code length N = 2 using numerals of ¹⁰ or less, N = a single sequence designed from the 2 ¹⁰ 2 ^3, 2 ^4, 2 ^5, ... , 2 ⁹ can be extracted and used. That is, in order to use the sequence of N = 2 ^9, the sequence of the code length 2 ⁹ is designed keeping the order of the index in a single sequence designed at N = 2 ¹⁰ . Likewise, when the maximum code length N = 2 ¹⁰ is used, it is used in a code of a short length using a sequence designed at N = 2 ¹⁰ . By using the design method described above, a sequence from a short-length sequence to a long-length sequence can be designed, and a single sequence having the longest length can be designed.

A single code design method is presented along with an example. First, N = 2 ⁵ , 2 ⁶ , ... , 2 ¹⁰ (k = 1, ..., 6) are used. Here, i denotes an index for each code length. Depending on the length of the code used, the design method can be extended to a longer length. At this time, in the present invention, N = N = 2 in the shorter length sequence is designed using a single length of ⁵ to ^{210, 26,} ... , And 2 ⁹ codes are proposed.

Here, having a good code means that the block error rate and the bit error rate are low at the same signal-to-noise ratio, or the signal-to-noise ratio necessary to achieve the same block (bit) error rate is low .

In this case, the sequence of the minimum length N = 2 ⁵ is designed by using the optimal code design method for each length. We then design a sequence of N = 2 ⁶ using the sequence designed at N = 2 ⁵ as a reference sequence. At this time, it is possible to design a sequence of N = ²⁶ length, maintaining the index order of the previous reference sequence designed in a shorter length.

The difference from the conventional method of designing each length-length sequence is to calculate the penalty so that the order of the reference sequence designed at N = 2 ⁵ can be maintained. For a case example that is not included in the final sequence of the reference index of the sequence (32 index below), counting only the penalty of index 1 of the index of below 32, and approximate the penalty is W _i of less than 32 indexes other than the first enemy You can set it to an infinite value, or you can set it so that it does not go out of the index sequence of the reference sequence by typing a very large value. Therefore, when calculating the first index, the penalty of indexes 1 and 33 and the indexes 33 to 64 over 33 are calculated, and the index with the lowest penalty value is added to the final sequence. The sequence of N = ²⁶ length is designed by repeating this process. If one of the indexes of 32 or less is added, the penalty of the index of 2 in the next sequence and the index of 33 or more are compared Determine the index to add. If this process is repeated, the index of 32 or less does not deviate from the order of the reference index sequence designed in the existing N = 2 ⁵ , and the sequence design of N = 2 ⁶ length becomes possible.

In other words, when the indexes of 32 or less are sequentially extracted in the designed N = 2 ⁶ sequence, the same sequence as the reference index sequence designed at N = 2 ⁵ is generated. Out by redesigning the sequence in the N = 2 ⁷ a sequence designed from the N = 2 to ⁶ repeating this algorithm as a reference sequence, wherein the sequence of the reference sequence designed from the N = 2 ⁶ is to be maintained. When the sequence is designed by repeating the algorithm up to N = 2 ¹⁰ , which is the longest length, a single sequence of a long length is designed to guarantee the performance at a short length. The minimum length N = 2 ⁵ and the longest length N = 2 ¹⁰ according to the code length used can be set to various values.

The above description will be further described with reference to the accompanying drawings.

FIG. 5 is a conceptual diagram illustrating a sequence for generating sequences of different lengths according to the present invention.

5, a length of 2 may generate a bit sequence 510, channel index optimized for the ^five. When the optimized bit channel index sequence corresponding to the length ²⁶ is generated, the optimized bit channel index sequence 510 corresponding to the length 2 ⁵ is used as it is. That is, as described above, the order of the reference sequence designed at N = 2 ⁵ is maintained, and only the subsequent sequence 520 is newly defined. Thus, when generating an optimized bit-channel index sequence of length ²⁶ , the newly defined sequence 520 can be arranged in sequence from sequence number 33 through sequence 64 from the best channel to the worst channel.

When a sequence having a length of 2 ⁷ is generated in this manner, a sequence having a length of 2 ⁶ is maintained, and only the remaining sequences can be newly generated. In addition, even when a sequence having a length of 2 ⁸ is generated, a sequence having a length of 2 ⁷ can be maintained and a sequence having a remaining length can be generated. If the desired maximum transmission length is 2 ¹⁰ in the system, up to 2 ¹⁰ lengths can be created using the above method.

In the case of using the optimized bit channel index sequence designed in this manner, since the length of data to be transmitted is designed to be optimized to a length of 2 ⁵ , even if the length of the data to be transmitted is 2 ⁵ , . In addition, if the length of data to be transmitted has a length of ²⁶ and kept at the single sequence designed from ²⁶ hayeoteumeuro designing the sequence of the longer length can increase the transmission efficiency at ^26.

6 is a flowchart of a single code sequence designing method according to the present invention.

Referring to FIG. 6, in step 600, each code rate, for example, R ₁ , R ₂ , ... , The bit channel index sequences optimized for R _T , S ₁ , S ₂ , ... , And S _T are generated. Thereafter, in step 602, i is set to 1, and it is checked whether i is greater than the T value. As described above, when the i value is larger than the T value, the final sequence design may be completed. However, if the initial i value is set to 1fh, the flow advances to step 6060 and the value of j is set to 1. In step 608, it is determined whether the value of j is larger than the value of N. Here, N may be a set code length. If j is not greater than N in step 608, the process proceeds to step 610 and a penalty can be calculated using Equation (3) or Equation (4) or the same concept as described above. That is, the penalty W _j can be calculated at S _i . The operation of step 324 may be performed until the code length is reached. Thereafter, step 610 is performed for all code lengths, and then step 616 is performed. In step 616, i is incremented by 1, and then step 604 is repeated.

Similar to FIG. 3 described above, in FIG. 6, if i is greater than T, it means that processing of the polar sign sequences for all the code rates is completed. Therefore, the value of i may be greater than 1 and less than or equal to T. If it is determined in step 604 that the processing of the polar sign sequences for all the code rates is not completed, the process proceeds to step 606 where the penalty can be calculated using Equation (3) or Equation (4) have. That is, Si can calculate the penalty Wi. Thereafter, based on Wi calculated in step 608, it can be mapped to the polar polar code single sequence Q and inserted. In step 610, the i value is incremented by one. In this manner, a single pole-code sequence Q can be generated for each code rate.

If the optimized bit channel index sequence is generated at all the code rates for a specific length, the BS proceeds to step 620 from step 604. Then, in step 612, the currently generated sequence can be determined as a final sequence applicable to all the code rates in a specific length. With the above-described method, an optimum bit channel index sequence can be generated for each code rate for a specific length, and the generated final sequence can be updated.

The bit sequences generated by the above method can be set as shown in the following table.

Table 1 shows the optimized bit channel index sequence when the target block error rate is 10% and the length is 32 (2 ⁵ ). It will also be apparent to those skilled in the art that the coding rate can be changed according to the target block error rate.

1 2 3 5 9 17 4 6 7 10 11 18 13 19 21 8 25 12 14 20 15 22 23 26 27 29 16 24 28 30 31 32

The numbers illustrated in Table 1 are values indicating channel indexes, which are arranged in descending order from the order in which the channels are read from the upper left to the lower right in the table.

In addition, if the target block error rate is 10% and the length is 64 (26), the optimized bit channel index sequence can be illustrated as shown in Table 2 below.

1 2 3 5 9 17 4 33 6 7 10 11 18 13 19 34 21 35 8 25 37 12 41 14 20 15 49 22 36 23 26 38 27 39 42 29 16 43 50 45 24 51 53 28 40 57 30 44 31 46 52 47 54 55 58 32 59 61 48 56 60 62 63 64

The numbers illustrated in Table 2 are values indicating channel indexes, which are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

If the target block error rate is 10% and the length is 128 (27), the optimized bit channel index sequence can be exemplified as shown in Table 3 below.

1 2 3 5 9 17 4 33 6 65 7 10 11 18 13 19 34 21 35 8 25 66 37 12 67 41 14 69 20 15 49 22 73 36 23 26 81 38 27 97 39 68 29 42 16 70 43 50 71 45 74 24 51 75 53 82 28 77 40 57 83 30 98 44 31 85 99 72 46 89 52 101 47 76 54 105 78 55 84 58 79 113 32 59 86 100 61 87 90 48 102 91 103 93 106 56 80 107 60 114 109 88 115 62 63 117 92 104 121 94 108 95 110 116 111 64 118 119 122 96 123 125 112 120 124 126 127 128

The numbers shown in Table 3 are values indicating channel indexes, which are arranged in descending order from the order in which channels are read in order from the upper left to the lower right in the table.

Table 10 shows the optimized bit channel index sequence when the target block error rate is 10% and the length is 256 (28).

1 2 3 5 9 17 4 33 6 65 7 10 129 11 18 13 19 34 21 35 8 25 66 37 12 67 41 14 130 69 20 49 15 131 73 22 36 133 23 81 26 38 137 27 97 39 68 29 42 145 16 70 43 50 161 71 45 132 74 51 24 75 193 134 53 82 28 77 135 40 57 83 138 30 98 85 139 31 44 146 99 141 72 89 46 147 52 101 47 162 76 149 54 105 163 78 55 153 136 84 58 113 194 79 165 32 59 140 86 195 169 61 100 87 142 197 90 48 148 177 102 143 91 201 150 103 93 106 56 164 151 209 80 154 107 60 114 166 155 109 225 167 115 88 196 62 157 170 117 63 144 198 171 92 178 104 121 199 173 94 202 179 152 95 108 203 181 210 156 110 205 168 185 116 211 158 111 226 64 118 213 159 172 227 119 200 217 174 122 180 229 175 96 123 204 182 233 125 206 183 112 212 186 241 207 160 187 214 120 228 189 215 218 176 230 124 219 231 126 221 234 184 208 127 235 188 242 237 216 243 190 191 245 220 232 249 222 236 223 128 238 244 239 192 246 247 250 224 251 253 240 248 252 254 255 256

The numbers illustrated in Table 4 are values indicative of the channel indexes, and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

If the target block error rate is 10% and the length is 512 (29), the optimized bit channel index sequence can be illustrated as shown in Table 5 below.

1 2 3 5 9 17 33 4 6 65 7 10 129 11 18 13 19 257 34 21 35 8 25 66 37 12 67 41 130 14 69 20 49 15 131 73 22 133 258 36 23 81 26 259 38 137 27 97 39 68 261 29 42 145 70 16 43 265 50 161 71 45 132 74 51 24 273 193 75 134 53 82 28 289 77 135 57 40 83 138 260 30 98 139 85 321 31 44 262 146 99 141 89 72 46 263 147 101 52 385 266 47 162 76 149 105 267 54 163 274 153 78 55 136 269 113 84 58 194 165 79 275 32 59 195 290 140 86 169 277 61 100 87 291 197 142 90 281 177 148 48 264 102 322 143 91 293 201 103 150 323 93 268 106 297 56 209 164 151 386 107 80 154 325 270 305 114 60 166 276 225 155 109 387 271 329 115 167 88 196 62 157 170 278 389 117 63 337 292 171 279 144 198 92 282 178 121 393 104 199 173 294 94 353 202 283 179 152 295 95 324 108 401 203 285 298 181 210 156 205 110 3 26 299 272 185 417 168 211 116 306 111 158 327 301 226 388 64 330 213 307 118 159 172 280 449 227 331 119 390 309 217 200 174 122 338 284 229 333 180 391 313 96 175 123 296 339 394 204 286 233 182 354 125 341 395 287 300 206 183 402 355 241 112 212 186 397 345 207 328 302 403 160 187 357 308 214 303 418 120 405 332 189 228 215 361 310 218 419 176 409 334 124 311 230 392 219 369 340 314 450 421 335 231 126 221 288 315 234 184 451 396 342 425 127 208 235 317 356 343 453 398 242 188 346 433 237 304 404 358 399 347 243 216 190 457 359 406 349 245 362 191 312 420 407 220 465 336 363 410 249 232 370 316 422 222 411 365 481 371 128 423 223 236 344 452 318 414 424 373 319 238 400 454 427 348 244 434 239 360 377 455 429 350 192 458 246 435 408 351 364 459 247 437 250 466 412 366 461 441 424 224 251 372 467 414 367 482 320 253 469 374 415 428 483 240 375 456 473 430 378 436 485 431 352 379 460 248 438 489 381 462 439 252 368 468 442 497 463 416 443 254 470 376 484 445 471 255 474 432 486 380 475 487 382 477 490 440 464 383 491 444 498 493 472 499 446 256 447 501 476 488 505 478 492 479 384 494 500 495 448 502 503 506 480 507 509 496 504 508 510 511 512

The numbers shown in Table 5 are values indicating the channel indexes, and are arranged in ascending order of the order in which the channel is improved from the channel having poor reading order from the upper left corner of the table.

If the target block error rate is 10% and the length is 1024 (210), the optimized bit channel index sequence can be exemplified as shown in Table 6 and Table 6b below. <Table 6> and <Table 6b> below can be understood as a form in which <Table 6> is followed by <Table 6b>.

1 2 3 5 9 17 33 4 6 65 7 10 129 11 18 13 257 19 34 21 35 513 8 25 66 37 12 67 41 130 69 14 20 49 15 131 73 22 133 258 36 81 23 26 259 137 38 27 97 261 39 68 514 145 29 42 70 265 43 16 515 161 50 71 45 132 74 517 273 51 24 193 75 134 53 521 82 289 28 77 135 57 83 40 138 260 30 529 98 321 139 85 31 44 262 146 99 141 545 89 72 263 46 147 385 101 266 52 516 47 162 149 76 577 267 105 54 163 274 518 153 78 269 55 136 113 194 84 58 165 275 519 79 641 522 195 32 59 290 140 86 169 277 523 61 100 291 87 197 769 142 530 281 177 90 264 148 48 322 525 102 143 293 91 201 531 103 150 323 546 93 297 268 106 209 56 533 164 151 386 325 107 154 80 547 270 305 537 114 225 166 60 276 387 155 109 578 520 271 329 549 115 167 196 88 62 157 278 170 389 579 337 117 553 63 524 292 279 171 198 144 92 642 282 393 581 178 121 199 353 104 173 526 561 294 283 202 94 179 532 643 152 585 401 527 295 324 95 203 108 285 298 181 534 645 210 770 593 156 205 326 299 110 417 272 185 548 535 211 168 306 116 771 649 111 538 327 158 301 226 388 609 330 64 213 550 307 449 118 159 539 172 280 773 227 657 331 551 217 309 390 119 580 541 200 338 554 122 174 229 333 284 777 391 180 313 673 123 175 96 339 582 555 296 394 528 204 233 286 562 354 182 125 583 341 557 395 785 644 287 586 300 206 183 563 705 402 241 355 112 536 186 212 397 345 207 587 328 646 302 565 403 801 357 160 187 594 308 214 589 418 303 540 647 405 120 569 189 361 332 595 228 215 650 552 772 310 833 419 218 542 610 409 176 597 651 334 124 311 230 369 392 450 219 543 421 774 314 556 340 658 611 335 231 653 601 126 221 897 451 234 315 288 775 584 184 659 342 558 396 425 613 127 778 564 235 317 208 674 356 343 559 453 661 242 398 433 617 346 188 588 779 237 566 404 304 675 358 786 457 399 243 347 665 216 190 781 590 567 625 648 706 359 677 406 787 570 596 245 349 191 362 591 465 312 420 407 220 707 802 571 544 681 249 363 652 598 410 336 789 232 481 370 573 422 316 222 803 612 709 599 411 365 654 689 793 602 128 371 223 423 236 834 452 660 776 344 318 560 413 805 614 426 655 713 603 373 319 835 238 615 427 662 454

[Table 6b]

The numbers illustrated in Table 6 and Table 6b are values indicating the channel indexes and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

Next, if the target block error rate is 1% and the length is 32 (25), the optimized bit channel index sequence can be illustrated as shown in Table 7 below.

1 2 3 5 9 17 4 6 7 10 11 18 13 19 21 25 8 12 14 20 15 22 23 26 27 29 16 24 28 30 31 32

The numbers shown in Table 7 are values indicating channel indexes. The numbers indicate the channel indexes from the upper left corner of the table to the upper left corner of the table, This is the order of the better.

If the target block error rate is 1% and the length is 64 (26), the optimized bit channel index sequence can be exemplified as shown in Table 8 below.

1 2 3 5 9 17 33 4 6 7 10 11 18 13 19 34 21 35 25 8 37 41 12 49 14 20 15 22 36 23 26 38 27 39 29 42 43 16 50 45 51 24 53 28 57 40 30 31 44 46 52 47 54 55 58 59 32 61 48 56 60 62 63 64

The numbers illustrated in Table 8 are values indicative of the channel indexes, and are arranged in descending order of the order in which the channels are improved from the poorly readable channels horizontally from the upper left corner of the table.

Table 9 shows the optimized bit channel index sequence when the target block error rate is 1% and the length is 128 (27).

1 2 3 5 9 17 33 4 65 6 7 10 11 18 13 19 34 21 35 25 66 8 37 67 41 12 69 49 14 20 73 15 22 81 36 23 26 97 38 27 39 68 29 42 43 70 16 50 71 45 74 51 24 75 53 82 77 57 28 83 40 98 30 85 31 99 44 89 101 72 46 52 47 105 76 54 113 78 55 58 84 79 59 32 86 61 100 87 90 48 102 91 103 93 106 56 107 80 114 60 109 115 88 62 117 63 92 121 104 94 95 108 110 116 111 64 118 119 122 123 96 125 112 120 124 126 127 128

The numbers illustrated in Table 9 are values indicating the channel indexes, which are arranged in descending order of the order in which the channel is improved from the channel having poor reading order from the upper left corner of the table.

If the target block error rate is 1% and the length is 256 (28), the optimized bit channel index sequence can be illustrated as shown in Table 10 below.

1 2 3 5 9 17 33 4 65 6 129 7 10 11 18 13 19 34 21 35 25 66 37 8 67 41 12 130 69 49 14 131 73 20 15 133 81 22 137 36 23 97 26 38 145 27 39 68 29 42 161 43 70 16 50 193 71 45 132 74 51 24 75 53 134 82 77 135 57 28 83 138 40 98 85 30 139 99 146 31 44 89 141 147 101 72 46 162 52 149 105 47 163 76 54 153 113 194 165 78 55 136 58 84 195 79 169 59 32 86 140 197 61 177 100 87 142 201 90 148 102 48 143 91 209 103 150 93 106 164 151 56 225 107 154 80 114 166 109 155 60 115 167 196 157 170 62 88 117 171 63 198 144 121 178 92 199 173 104 202 179 94 152 203 181 95 108 210 205 185 156 110 211 168 116 226 111 158 213 64 118 159 227 172 217 119 229 200 122 174 180 123 175 233 96 204 182 125 241 206 183 186 212 112 207 187 160 214 189 120 228 215 218 230 176 219 124 231 221 234 126 184 127 235 208 242 188 237 243 216 190 245 191 220 249 232 222 223 128 236 238 244 239 192 246 247 250 251 224 253 240 248 252 254 255 256

The numbers illustrated in Table 10 are values indicating the channel indexes, and they are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

Table 11 shows the optimized bit channel index sequence when the target block error rate is 1% and the length is 512 (29).

1 2 3 5 9 17 33 4 65 6 129 7 10 257 11 18 13 19 34 21 35 25 66 37 8 67 41 130 12 69 49 131 14 73 20 15 258 133 81 22 259 137 36 23 97 26 261 145 38 27 39 265 68 29 42 161 43 70 273 193 16 50 71 45 132 74 51 289 75 24 53 134 82 321 77 135 57 83 28 138 260 40 98 385 85 139 30 262 146 99 31 89 141 44 263 147 101 266 72 46 162 149 105 52 267 47 163 274 76 153 113 54 269 194 165 275 78 55 136 58 84 195 290 79 169 277 59 197 291 32 86 140 177 281 61 100 87 322 293 201 142 90 264 148 323 102 143 91 297 48 209 103 386 150 93 325 106 268 305 225 164 151 387 56 107 154 329 270 80 114 166 109 276 155 60 271 389 115 337 167 196 157 393 170 278 62 88 117 353 171 292 279 198 63 121 282 178 144 92 401 173 199 294 283 104 202 179 94 295 417 324 203 285 152 181 298 95 108 210 205 185 2 99 326 449 211 156 306 110 272 301 327 168 116 226 111 388 213 330 307 158 227 64 118 159 331 217 172 280 309 390 338 119 229 333 122 313 391 200 174 339 284 394 233 180 123 175 354 96 296 341 204 395 286 125 182 241 355 402 287 345 397 183 206 300 186 403 212 357 112 207 328 302 187 418 405 160 361 308 214 303 189 419 120 215 228 332 409 369 310 218 450 421 311 230 334 176 219 392 124 314 451 340 425 335 231 221 315 234 126 453 288 342 396 184 433 127 235 317 356 343 208 242 457 398 346 237 188 404 243 358 399 304 347 465 190 216 359 245 406 349 362 191 481 420 407 312 249 363 220 410 336 370 232 422 365 411 316 222 371 423 452 413 128 223 426 236 318 344 373 427 454 319 238 377 400 434 348 244 429 455 239 360 458 435 350 192 246 408 459 437 351 247 364 466 250 461 441 412 467 366 251 224 424 372 482 367 414 469 253 320 483 374 415 428 473 375 240 485 456 378 430 436 489 379 431 352 460 248 438 381 497 462 439 252 442 468 368 463 443 416 254 470 445 255 376 484 471 474 486 432 475 380 487 477 490 382 440 383 491 464 498 493 444 499 472 446 256 501 447 476 505 488 478 479 384 492 494 500 495 448 502 503 506 507 480 509 496 504 508 510 511 512

The numbers illustrated in Table 11 are values indicative of the channel indexes, and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

If the target block error rate is 1% and the length is 1024 (210), the optimized bit channel index sequence can be exemplified as shown in Table 12 and Table 12b. <Table 12> and <Table 12b> can be understood as a form in which <Table 12> is followed by <Table 12b>.

1 2 3 5 9 17 33 4 65 6 129 7 10 257 11 18 13 513 19 34 21 35 25 66 37 8 67 41 130 12 69 49 131 73 14 20 258 15 133 81 22 259 137 97 36 23 26 261 514 145 38 27 515 265 39 68 161 29 42 517 273 70 43 193 50 16 71 45 521 132 74 51 289 75 134 53 24 529 82 321 77 135 57 83 138 260 28 545 385 98 40 85 139 30 262 146 99 577 89 141 31 44 263 147 101 266 516 72 162 46 641 149 105 267 52 47 163 518 274 153 76 113 269 54 194 769 165 275 519 78 55 136 522 195 290 58 84 169 79 277 523 59 197 291 140 86 32 177 281 530 61 525 322 201 293 100 87 142 531 90 323 264 148 297 102 143 91 546 48 209 533 386 103 325 150 93 547 305 268 106 225 537 164 151 387 56 329 107 578 154 549 270 114 80 166 389 109 276 155 579 520 271 60 337 115 553 167 196 157 393 170 278 642 581 117 62 88 353 561 524 17 1 292 279 198 63 121 643 401 282 585 178 144 173 199 92 526 294 283 202 179 770 645 104 532 593 417 94 527 295 324 285 203 181 152 298 95 771 649 210 534 108 205 609 449 185 299 326 548 211 535 156 773 306 110 657 272 301 327 538 226 168 116 388 213 111 330 307 550 158 777 539 227 673 64 217 331 118 159 309 551 390 172 280 580 541 338 229 554 119 333 785 313 391 122 200 705 174 339 555 582 233 394 284 180 123 175 562 354 801 341 96 296 528 583 557 395 241 125 204 644 286 182 586 563 355 402 345 397 287 183 206 300 587 833 565 403 357 646 186 536 212 112 207 594 418 589 328 569 302 187 405 647 361 897 595 160 214 308 650 772 303 540 189 419 409 369 610 215 228 332 120 597 552 651 310 218 450 421 542 774 611 658 311 230 601 334 219 653 176 392 124 451 543 314 425 340 556 775 231 335 659 613 221 778 453 315 234 126 674 584 433 342 288 558 396 661 617 184 127 235 317 779 564 457 343 559 675 356 786 242 208 398 665 237 346 625 588 781 706 677 188 465 243 566 404 358 399 347 304 787 567 590 707 245 802 681 359 648 190 349 216 406 570 481 596 362 789 591 191 249 420 407 571 312 709 803 363 220 410 689 598 652 544 793 370 573 336 834 232 422 365 411 713 599 805 612 222 316 371 654 602 423 413 452 835 776 223 128 660 809 721 426 614 655 373 236 603 318 344 560 898 427 837 615

[Table 12b]

The numbers illustrated in Table 12 and Table 12b are values indicating channel indexes and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

Next, if the target block error rate is 0.1% and the length is 64 (2 ⁶ ), the optimized bit channel index sequence can be exemplified as shown in Table 13 below.

1 2 3 5 9 17 33 4 6 7 10 11 18 13 19 34 21 35 25 37 8 41 12 49 14 20 15 22 23 36 26 38 27 39 29 42 43 50 16 45 51 53 24 57 28 40 30 31 44 46 52 47 54 55 58 59 32 61 48 56 60 62 63 64

The numbers shown in Table 13 are values indicating the channel indexes, and they are arranged in descending order of the order in which the channel is improved from the channel in which the order is not good to be read horizontally from the upper left corner of the table.

Next, if the target block error rate is 0.1% and the length is 128 (27), the optimized bit channel index sequence can be illustrated as shown in Table 14 below.

1 2 3 5 9 17 33 65 4 6 7 10 11 18 13 19 34 21 35 25 66 37 67 8 41 69 49 12 73 14 81 20 15 22 97 23 36 26 38 27 39 29 68 42 43 70 50 45 71 16 74 51 75 53 24 82 77 57 83 28 98 85 40 40 99 99 31 44 101 72 46 105 52 47 113 76 54 55 78 58 84 79 59 86 32 61 87 100 90 102 91 48 103 93 106 107 56 114 80 109 60 115 117 62 88 63 121 92 104 94 95 108 110 116 111 118 64 119 122 123 96 125 112 120 124 126 127 128

The numbers illustrated in Table 14 are values indicative of the channel indexes, and are arranged in ascending order of the order in which the channel is improved from the channel in which the order is poor to read horizontally from the upper left corner of the table.

Next, if the target block error rate is 0.1% and the length is 256 (28), the optimized bit channel index sequence can be illustrated as shown in Table 15 below.

1 2 3 5 9 17 33 65 4 129 6 7 10 11 18 13 19 34 21 35 25 66 37 67 41 8 130 69 49 12 131 73 133 14 81 20 15 137 97 22 145 36 23 26 161 38 27 39 29 68 193 42 43 70 50 45 71 16 132 74 51 75 53 134 82 24 77 57 135 138 138 28 98 85 139 40 99 146 30 89 141 31 101 147 44 162 149 105 72 46 163 52 47 153 113 194 76 165 54 195 169 55 78 136 58 84 79 197 177 59 86 140 201 32 61 87 100 209 142 90 148 102 143 91 48 225 103 93 150 106 151 164 107 56 154 114 109 166 155 80 115 60 167 157 196 170 117 62 88 171 121 198 63 178 173 199 144 92 202 179 104 203 94 181 210 152 95 205 185 108 195 156 110 226 213 116 168 111 158 227 217 159 118 64 229 172 119 122 233 200 174 123 180 175 241 96 204 125 182 183 206 186 212 207 112 187 214 160 189 215 228 120 218 230 219 176 124 231 221 234 126 235 184 127 242 208 237 188 243 245 190 216 191 249 220 232 222 223 128 236 238 244 239 246 192 247 250 251 224 253 240 248 252 254 255 256

The numbers shown in Table 15 are values indicating the channel indexes, which are arranged in descending order of the order in which the channels are improved from the channels in which the order is not good to be read horizontally from the upper left corner of the table.

Next, if the target block error rate is 0.1% and the length is 512 (29), the optimized bit channel index sequence can be illustrated as shown in Table 16 below.

1 2 3 5 9 17 33 4 65 6 129 7 10 257 11 18 13 19 34 21 35 25 66 37 67 41 8 130 69 49 131 12 73 258 133 81 14 20 15 259 137 97 22 261 145 36 23 26 265 161 38 27 273 193 39 68 29 42 289 43 70 50 45 71 132 16 74 51 321 75 53 385 134 82 24 77 57 135 83 260 138 98 28 85 139 262 40 99 146 89 30 141 263 101 31 147 266 44 162 149 105 267 72 46 163 153 274 113 52 269 194 47 165 76 275 54 195 169 290 277 55 78 136 58 197 84 291 79 177 281 59 322 201 86 293 140 61 32 87 323 100 209 297 142 90 264 386 325 225 148 143 102 305 91 48 103 387 93 150 329 106 268 151 164 389 107 154 337 56 270 114 109 166 155 276 393 80 271 115 353 167 157 401 60 196 170 117 278 62 171 279 88 121 198 292 417 178 63 282 173 199 294 144 92 283 179 202 449 295 104 285 203 181 324 94 298 210 152 95 205 185 2 99 108 326 211 306 301 226 327 156 213 110 388 307 272 330 227 217 116 111 168 331 158 309 390 229 159 118 64 338 333 313 172 280 119 391 233 339 394 122 354 241 341 200 174 395 123 284 180 175 296 355 125 96 402 345 204 286 397 182 357 403 287 183 206 300 186 418 361 405 212 207 112 187 328 302 419 409 369 214 308 189 303 160 450 421 215 228 332 120 310 218 451 425 311 230 219 334 392 314 453 433 124 176 340 231 335 221 315 234 126 457 342 396 317 235 288 127 184 343 242 356 465 237 398 346 208 243 404 399 188 358 347 481 304 245 359 349 190 406 216 362 249 191 407 420 363 410 312 370 365 220 422 411 336 232 371 423 222 413 316 452 426 373 223 128 236 318 427 377 454 344 319 434 238 429 455 400 348 244 435 239 458 360 459 437 350 246 192 466 408 351 247 461 441 364 250 467 251 412 482 366 469 372 424 224 253 367 483 414 473 415 374 320 485 428 375 489 240 378 456 430 379 436 431 497 352 381 460 248 438 439 462 442 252 468 463 368 443 254 470 416 445 255 471 484 376 474 486 475 432 380 487 477 490 382 491 440 383 498 464 493 499 444 501 446 472 256 447 505 476 488 478 479 384 492 494 500 495 502 448 503 506 507 480 509 496 504 508 510 511 512

The numbers illustrated in Table 16 are values indicating the channel indexes, and are arranged in descending order from the order in which the channels are read from the upper left to the lower right in the table.

Next, if the target block error rate is 0.1% and the length is 1024 (2 ¹⁰ ), the optimized bit channel index sequence can be exemplified as shown in Table 17 and Table 17b. <Table 17> and <Table 17b> below can be understood as a form in which <Table 17> is followed by <Table 17b>.

1 2 3 5 9 17 33 4 65 6 129 7 10 257 11 18 13 513 19 34 21 35 25 66 37 67 41 130 8 69 49 131 73 12 258 133 81 14 259 20 137 15 97 261 514 22 145 36 23 515 265 26 161 517 38 27 273 193 39 68 29 42 521 289 43 70 50 529 45 71 321 132 16 74 51 545 75 53 134 385 82 77 24 57 135 577 83 260 138 98 85 28 139 641 262 99 146 40 89 141 30 263 147 101 31 266 769 516 44 162 149 105 267 72 163 46 518 274 153 113 269 52 47 194 165 519 275 76 522 54 195 290 169 277 55 78 523 136 197 291 58 177 84 281 79 530 59 525 322 201 293 86 531 323 61 140 32 209 297 87 100 546 142 90 533 386 325 264 148 305 225 143 102 91 547 537 387 48 103 329 93 150 578 549 106 268 389 151 164 337 579 107 553 154 270 56 114 393 109 642 166 155 276 581 353 520 271 80 561 115 167 157 196 60 401 643 170 117 278 585 770 417 524 62 171 279 292 121 198 645 88 593 282 178 63 173 199 526 294 283 144 179 771 202 92 649 449 532 609 527 295 285 203 181 104 324 94 298 773 657 210 534 205 185 152 95 299 326 211 108 777 535 548 673 306 301 327 538 226 213 388 156 110 307 330 785 705 550 272 539 227 116 168 111 217 331 158 309 801 551 541 390 229 580 338 159 118 64 554 333 313 172 280 391 119 233 339 555 394 582 833 122 200 174 354 562 341 241 123 557 284 395 583 180 175 644 355 563 586 897 402 125 296 528 345 96 397 204 286 182 587 357 565 403 287 646 183 594 206 300 418 589 361 569 405 647 186 595 419 772 369 650 212 207 536 187 328 112 302 409 610 214 597 450 421 651 189 308 303 540 160 774 215 228 611 332 658 120 552 601 310 218 451 653 425 542 775 613 659 311 230 219 334 453 543 392 778 314 433 176 124 340 231 674 617 661 221 556 335 457 315 234 779 675 126 584 342 558 396 317 235 665 625 786 288 781 465 706 677 127 184 564 343 242 559 356 237 787 481 707 681 346 802 398 243 588 566 208 404 399 358 188 789 347 709 689 803 245 567 359 590 304 349 648 406 190 570 362 216 596 249 793 591 191 407 420 713 571 834 363 805 410 598 652 312 370 573 220 365 544 422 411 835 721 809 599 371 612 898 336 654 232 602 423 222 837 737 413 316 817 452 373 776 426 660 655 603 614 223 899 128 236 318 841 377 427 344 615 454 605 560 662 434 618 319 901 429 780 455 238 849 663 676 435 400 619 458 244 239 905 865 666 348 626 782 568 360 621

[Table 17b]

The numbers illustrated in Table 17 and Table 17b are values indicating channel indexes and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

The contents of Table 1 to Table 17b described above are configured to have different optimized bit channel index sequences according to respective coding rates. However, the complexity of the terminal can be increased if it is configured as shown in <Table 1> to <Table 17b>. Therefore, as described in the second embodiment of the present invention, only one sequence of the maximum length is configured, and when data having a short length is to be transmitted using the sequence, a sequence of a bit channel index optimized for the corresponding length is selected and used It is possible. If the maximum length is assumed to be 1024, it can be configured as follows according to the required or target block error rate.

When the target block error rate is 10%, the optimized bit channel index sequence can be exemplified as shown in Table 18 and Table 18b when a single sequence of polar sign is used. <Table 18> and <Table 18b> below can be understood as a form in which <Table 18> is followed by <Table 18b>.

1 2 3 5 9 17 33 4 6 65 7 10 129 11 18 13 257 19 34 21 35 8 25 66 37 67 12 41 130 69 14 49 20 15 131 73 22 133 258 36 81 23 26 259 137 38 27 97 261 39 68 145 29 42 265 70 43 16 161 50 71 45 132 74 273 51 193 24 75 134 53 289 82 77 28 135 57 83 138 40 260 321 30 98 139 85 262 31 44 146 99 141 89 385 263 72 147 46 101 266 52 47 513 514 515 517 521 529 545 516 162 76 149 577 54 105 267 163 274 518 78 55 153 136 269 84 58 79 113 194 165 275 519 641 522 32 59 140 86 195 290 169 277 523 100 61 87 291 142 197 769 530 90 281 48 148 177 264 102 322 525 143 91 293 201 531 150 103 323 546 93 268 106 297 56 164 151 209 533 386 80 154 107 325 547 270 305 537 60 114 166 276 155 109 225 387 578 520 271 329 549 167 88 115 196 62 157 170 278 389 579 63 117 337 553 524 292 144 198 171 279 92 642 282 581 178 104 121 393 199 173 294 94 353 526 561 202 283 179 532 643 152 585 527 295 108 95 324 401 203 285 298 181 534 645 210 770 593 156 110 205 326 299 272 168 185 417 548 535 116 211 306 771 649 158 111 538 327 301 226 388 609 64 330 118 213 550 307 159 172 280 449 539 773 227 657 331 551 119 390 309 200 217 580 541 174 122 338 554 284 180 229 333 777 391 175 96 313 673 123 296 339 582 555 394 528 204 286 182 233 562 354 125 583 341 557 395 785 644 287 586 300 206 183 563 402 355 112 212 186 241 705 536 397 345 207 587 328 646 302 565 403 160 187 357 801 594 308 214 589 303 418 540 647 120 405 569 332 228 189 215 361 595 650 552 772 310 833 218 419 542 610 176 409 597 651 334 230 124 311 392 219 369 340 314 450 543 421 774 556 658 611 335 231 653 601 126 221 897 288 315 234 184 451 775 584 659 396 342 558 425 613 208 127 778 564 235 317 674 356 343 559 453 661 398 188 242 346 433 617 588 779 237 566 304 404 675 358 786 399 347 216 243 190 457 665 781 590 567 625 648 706 359 677 406 787 570 596 349 191 245 362 591 312 420 407 220 465 707 802 571 544 681

[Table 18b]

The numbers shown in Table 18 and Table 18b are values indicating the channel indexes and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

When the target block error rate is 1%, the optimized bit channel index sequence when using a single sequence of polar sign can be exemplified as shown in Table 19 and Table 19b. <Table 19> and <Table 19b> below can be understood as a form in which <Table 19> is followed by <Table 19b>.

1 2 3 5 9 17 33 4 6 65 7 10 129 11 18 13 19 34 21 35 25 257 513 66 8 37 67 41 12 130 69 49 14 131 20 73 15 258 133 22 81 259 137 36 23 26 97 261 514 38 145 27 515 39 265 68 29 42 161 517 43 70 273 16 50 193 71 45 521 132 74 51 289 24 75 53 134 529 82 321 77 135 28 57 83 138 260 545 40 98 385 30 85 139 262 146 31 99 577 44 89 141 263 147 101 266 516 72 46 162 641 52 149 47 105 267 163 518 274 76 54 153 113 269 194 769 165 275 519 78 55 136 522 58 84 195 290 79 169 277 523 59 32 86 140 197 291 61 177 281 530 525 100 87 322 293 142 201 531 90 264 148 323 48 102 143 91 297 546 209 533 103 386 150 93 325 547 106 268 305 164 151 56 225 537 387 107 154 329 578 549 270 80 114 166 60 109 276 155 271 389 579 520 115 337 553 167 196 157 393 170 278 642 581 88 62 117 353 561 524 17 1 292 279 63 198 144 92 121 643 282 178 401 585 199 173 526 294 283 104 202 179 770 645 532 593 94 295 417 527 324 152 203 285 181 298 95 771 649 108 210 534 205 609 185 299 326 449 548 156 110 211 535 773 306 657 272 301 327 538 168 116 226 111 388 158 213 330 307 550 777 539 64 118 159 227 673 331 172 217 280 309 551 390 580 541 338 119 229 554 333 785 200 122 313 391 705 174 339 555 582 284 394 180 123 175 233 562 354 801 96 296 341 528 583 557 204 395 286 182 125 241 644 586 563 355 402 287 345 397 206 183 300 587 833 565 186 403 212 357 646 536 112 207 594 328 302 187 418 589 569 405 647 160 361 897 595 308 214 650 772 303 540 189 419 120 228 215 332 409 369 610 597 552 651 310 218 450 421 542 774 611 658 311 230 601 334 176 219 653 392 124 314 451 543 340 425 556 775 335 231 659 613 221 778 315 234 126 453 674 584 288 342 396 184 433 558 661 617 127 235 317 779

[Table 19b]

The numbers illustrated in Table 19 and Table 19b are values indicating the channel indexes and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

When the target block error rate is 0.1%, the optimized bit channel index sequence when using a single sequence of polar sign can be exemplified as shown in Table 20 and Table 20b below. <Table 20> and <Table 20b> below can be understood as a form in which <Table 20> is followed by <Table 20b>.

1 2 3 5 9 17 33 4 65 6 7 129 10 257 11 18 13 513 19 34 21 35 25 66 37 67 8 41 130 69 12 49 131 73 258 133 14 81 20 15 259 137 22 97 261 514 145 23 36 515 26 265 161 517 38 27 273 39 29 68 193 42 521 289 43 70 50 529 16 45 71 132 74 51 321 545 75 53 385 134 24 82 77 57 135 577 83 260 138 28 98 85 139 641 262 40 30 99 146 89 141 263 31 44 101 147 266 516 769 162 149 72 46 105 267 163 518 52 47 153 274 113 269 194 76 165 519 275 522 54 195 169 290 277 55 78 523 136 58 84 79 197 291 177 281 530 59 525 322 86 140 201 293 531 32 61 87 323 100 209 297 546 142 90 533 264 386 325 148 102 143 91 48 225 305 547 537 103 387 93 150 329 578 549 106 268 151 164 389 107 56 154 337 579 553 270 114 80 109 166 155 276 393 642 581 271 60 115 353 520 561 167 401 157 196 643 170 117 278 585 524 62 88 171 198 63 121 279 292 770 645 417 593 178 282 173 199 526 294 144 92 283 202 179 771 649 449 532 609 527 295 104 285 203 94 181 324 298 773 657 210 534 152 95 205 185 299 108 326 211 777 535 548 673 306 301 327 538 156 110 226 213 388 307 272 785 330 550 539 116 168 111 158 227 705 217 331 309 551 541 390 580 159 118 64 229 801 338 554 333 313 172 280 119 391 122 233 339 555 394 833 582 354 200 174 562 123 180 175 241 341 557 284 395 583 644 296 96 204 125 355 563 586 402 528 345 286 397 897 182 587 357 565 403 287 646 183 594 206 300 186 418 589 361 569 405 647 595 212 207 112 187 328 302 419 772 650 536 409 369 610 214 308 597 160 189 303 450 421 651 540 774 215 228 611 332 658 120 552 601 310 218 451 653 425 542 775 613 659 311 230 219 334 392 314 453 543 778 433 176 124 340 231 674 617 661 335 221 556 315 234 126 457 779 675 584 342 558 396 317 235 665 625 786 288 184 127 781 343 242 356 465 564 706 559 677 208 237 787 398 346 188 243 404 399 358 347 481 588 707 566 681 802 789 709 689 803 304 245 567 359 590 349 648 190 406 570 216 362 596 191 249 793

[Table 20b]

The numbers illustrated in Table 20 and Table 20b are values indicative of the channel index and are arranged in descending order from the order in which channels are read from the upper left to the lower right in the table.

On the other hand, if the target block error rate is 1% and the total code length is 1536, the optimized bit channel index sequence can be exemplified as shown in Table 21 and Table 21b. The following Tables 21 and 21b can be understood as connected form. When the total code is 1536, encoding is performed with N = 1024 length 210 using Table 21 and Table 21b, and again with N = 512 (25) length using Table 21, It may be the case that the encoded polar codeword is repeatedly transmitted. Unlike the previous examples, the number of channel indexes is 512 in Table 21 and Table 21b, respectively. Therefore, in the case of 1536 in total, coding is performed with N = 1024 length 210 using Table 21 and Table 21b, and coding is performed using N = 512 (25) The polar codeword can be repeatedly transmitted. Also, the numbers illustrated in <Table 21> and <Table 21b> are values indicating the channel indexes, and are arranged in descending order from the order in which channels are read from the upper left to the lower right.

1 513 257 129 65 33 17 2 3 34 18 5 514 258 130 66 67 35 19 9 515 517 521 259 261 265 131 133 137 69 73 37 41 21 25 4 529 273 145 81 49 6 545 97 7 289 161 20 10 516 260 132 68 36 11 321 262 193 134 70 38 22 13 518 577 519 522 641 523 263 266 385 267 135 138 139 71 74 75 82 39 42 43 50 23 26 27 29 8 530 525 274 269 146 141 147 77 83 45 51 12 769 531 275 290 162 149 98 85 53 14 546 533 277 163 99 89 72 57 40 24 15 547 520 537 578 549 579 524 553 642 581 526 561 532 527 291 264 281 322 293 323 268 297 386 325 270 305 276 387 271 329 136 153 194 165 140 195 169 197 142 177 148 143 201 150 101 76 105 78 113 84 79 44 46 52 47 54 55 28 30 31 16 643 585 534 645 548 770 535 593 538 771 649 550 539 609 773 551 580 657 541 554 777 673 582 555 528 562 785 583 557 705 644 586 563 801 536 587 565 646 594 589 647 540 552 278 389 292 279 337 282 393 294 353 283 295 401 324 285 298 417 299 326 272 306 327 301 449 388 330 307 280 331 309 390 338 333 391 313 284 339 394 296 286 164 151 209 154 166 225 155 167 196 157 170 171 198 144 178 199 173 202 179 152 203 181 210 205 185 156 211 168 226 158 100 87 90 102 91 103 93 106 107 80 114 109 115 88 117 92 121 104 94 95 108 58 569 595 650 772 542 354 213 159 172 59 61 48 56 60 62 63 32 610 651 597 543 556 833 774 658 611 653 584 601 558 775 659 897 613 564 778 559 674 661 588 617 779 566 675 786 665 590 781 567 625 648 706 677 596 570 787 591 707 802 571 681 544 789 652 598 709 803 573 612 689 599 793 654 602 834 805 713 776 660 560 614 655 603 835 809 721 615 662 605 780 618 676 663 568 592 341 395 287 300 402 355 397 345 3 28 302 403 357 308 303 418 405 332 361 310 419 409 334 369 311 392 450 421 314 340 335 451 315 288 425 342 396 453 317 356 343 433 398 346 457 404 304 358 399 347 465 359 406 349 362 420 407 312 481 363 410 336 370 422 316 227 217 200 174 229 180 175 204 233 182 206 183 241 212 186 207 187 160 214 189 228 215 218 176 230 219 231 221 234 184 235 208 242 237 188

[Table 21b]

7 is a conceptual block diagram of a transmitting apparatus for applying the polar coding scheme according to the present invention.

Hereinafter, a transmitting apparatus for applying the polar coding scheme according to the present invention will be described with reference to FIG. It should be noted that in FIG. 7, only the configuration necessary for explaining the present invention is illustrated. The apparatus configuration of FIG. 7 that transmits data in the polar code manner may be applied to the base station, or may be applied to the terminal apparatus. Therefore, if the configuration of the apparatus according to the present invention is applied to a terminal apparatus, various additional elements for the convenience of the user may be further included. Further, if the configuration of the apparatus according to the present invention is applied to a base station, the base station may further include elements necessary for the base station, and may be configured in a more complex form. In the following description, however, only the minimum configuration required for transmitting data is exemplified by applying the present invention in order not to obscure the gist of the present invention.

According to the present invention, the controller 701 can determine the code rate according to the error rate required for the data to be transmitted and determine the size of the data to be transmitted. The control unit 701 can perform various controls necessary for data transmission as described above. Also, the controller 701 may determine in the memory 703 which sequence of the optimized bit-channel index sequences generated according to the present invention is to be used. Accordingly, the control unit 701 can control to read the sequence from the memory 703 or output a specific sequence out of the sequence stored in the memory 703 to the polar coder 705. The control unit 701 can also provide the data to be transmitted to the polar coder 705. When the controller 701 is located in the terminal, the controller 701 may be a single processor that incorporates a communication processor, an application processor, or both, or may be configured using specific control logic. Also, when the control unit 701 is located in the base station, the control unit 701 may be a control processor included in the scheduler or the base station, or may be configured using specific control logic.

The memory 703 may store optimized bit-channel index sequences of the type described above. For example, one index that can be applied to all lengths is stored according to each required error rate, that is, a code rate, and the indexes corresponding to each required error rate, that is, the code rate, for each length.

Therefore, when one index applicable to all the lengths is stored according to each required error rate, that is, the coding rate, the memory 703 stores the above-mentioned Table 18, Table 18b, Table 19, Table 19b, , <Table 20> and <Table 20b>. On the other hand, if the required error rate, that is, the coding rate, as well as the different sequences applicable to the length are requested, the tables of Table 1 to Table 17b may be stored. Table 21 and Table 21b for the length 1536 may also be stored.

The polar coder 705 can encode and output data using the data provided from the controller 701 and the sequences of the tables stored in the memory 703 under the control of the controller 701. [ The transmitter / receiver 707 can perform processing processing in the system to transmit data in a desired manner, for example, according to a specific wireless communication method or a wired communication method. FIG. 7 illustrates a case where the present invention is applied to a wireless communication system, and it is possible to transmit pole-coded data by performing band up conversion and power amplification of a signal in a frequency band set in the wireless communication system.

8 is a control flowchart for performing polar coding in data transmission in a transmitting apparatus according to an embodiment of the present invention.

The control unit 701 maintains the standby state at step 800. [ Here, the standby state is a state in which a specific operation is not required and only a basic monitoring operation of the terminal or the base station is performed. Thereafter, the controller 701 proceeds to step 804 when data transmission is requested in step 802, and to step 800 when data transmission is not required.

The controller 701 requests data transmission and proceeds to step 804 to determine the length and coding rate of data requested to be transmitted. At this time, various factors such as the length of the data to be transmitted and the coding rate should be considered, such as the state of the channel and the transmission power to the receiving side. Here, the operation of determining the length and the coding rate of the data may be any known method or any of the methods to be used in the future, so that no particular limitation is imposed.

If the length of the data to be transmitted and the coding rate are determined, the controller 701 can proceed to step 806 and select the polar coding sequence stored in the memory 703. [ At this time, it is possible to distinguish a case where different pole encoding sequences are stored for each length in the memory 703 and a case where one sequence applicable to all the lengths is stored.

First, a case in which different polar encoding sequences for different lengths are stored in the memory 703 will be described. Assume that the data to be transmitted has a very short length, for example, a length 10, as a specific control signal. In this case, there is actually no matched length in the table. Therefore, in this case, the controller 701 can select the minimum length having the target error rate, such as the length 32 or 64, which is the shortest length. If the length has a length exceeding 32, such as 40, the sequence of length 32 can not be used, so the controller 701 selects a sequence of length 64.

On the other hand, as described above, when only the longest sequences are stored in the memory 703, the controller 701 can select a sequence corresponding to the target error rate among the longest sequences.

If a specific sequence is selected in step 806, the controller 701 proceeds to step 808 and controls the polar coder 705 to perform polar coding using the selected sequence. Also, it is possible to control the polar coded data in the polar coder 705 to control the transceiver 707 to transmit it to the receiving side.

In step 810, the controller 701 determines whether the transmission of all data requested to be transmitted is completed. If the transmission of all the data is not completed, the controller 701 proceeds to step 808 to continue the polarity encoding and data transmission operations. On the other hand, if the transmission of all the data is completed, the controller 701 may proceed to step 800 and maintain the standby state.

Next, a result of a comparison of the error rate performance when applying the polar coding scheme of the present invention will be described.

FIGS. 9A and 9B are graphs of a comparison simulation in the case of applying the polar coding method of the present invention and the case of using the polar coding method having the simple polynomial described in the description of the present invention.

First, FIG. 9A compares the SNR performance required to achieve a block error rate (BLER) of 0.1% with respect to a code length N = 2048 according to the change in the number of information bits. In FIG. 9A, 'A' denotes the case of the polar encoding method having the simple polynomial described above in the description of the present invention. In contrast to the case of applying the sequence according to the present invention and the case of A, it can be confirmed that the inventive sequence has excellent performance because the SNR is lower than that of the present invention or the SNR is lower than that of the present invention .

Next, FIG. 9B compares the block erasure performance according to various coding rates for N = 512. The portion indicated by the solid line for each code rate is the performance of the invention sequence, and the portion indicated by the dotted line is the case of the polar coding method having simple polynomial. As can be seen from the graph of FIG. 9B, it can be seen that the sequence of the present invention has superior performance on the basis of BLER 0.1% as compared with the sequence of the prior art.

Further, another embodiment of the present invention will be described concretely with reference to <Table 22>. The target bit error rate (target block error rate) is 2%, and the code length is 64, the optimized bit channel index sequence can be illustrated as shown in Table 22 below. Also, the numbers shown in Table 22 below are values indicating the bit index of the polar sign, and the least significant bit index follows from 1. The following sequence is recorded from the channel having the bad channel to the channel having the good channel according to the channel status. A sequence of length N = 64 listed in Table 22 is used for encoding and decoding of a polarity code having a code size of 64, and a sequence having a length greater than 64, for example, N = 128, 256, 512, Can be used as a subset of sequences. That is, the sequence of numbers 1 to 64 on a long sequence shall follow the order of <Table 22>.

1 2 3 5 9 17 33 4 6 7 10 11 18 13 19 34 21 25 35 8 37 12 41 14 20 15 49 22 23 36 26 38 27 42 39 29 43 16 45 50 24 51 53 28 40 57 30 31 44 46 52 47 54 55 58 59 32 61 48 56 60 62 63 64

Other embodiments of the present invention will be described in detail with reference to Table 23. The optimized bit channel index sequence when the target block error rate is 5% and the code length is 64 can be exemplified as shown in Table 23 below. Also, the numbers shown in Table 23 below are values indicating the bit index of the polar sign, and the least significant bit index follows from 1. The following sequence is recorded from the channel having the bad channel to the channel having the good channel according to the channel status. A sequence of length N = 128 listed in Table 23 is used for encoding and decoding of a polarity code having a code size of 128 and a sequence of lengths longer than 128 such as N = 256, 512, and 1024 length sequences It can be used as a subset. Also, values from 1 to 64 can be used as a subset of the longer length sequence during N = 128 sequences in Table 23 below. Also, a value of 65 to 128 of N = 128 sequences in Table 23 below can be used as a subset of a longer length sequence. That is, the order of the numbers 1 to 128 on the long sequence is to follow the order of <Table 22>.

One 2 3 5 9 17 33 4 6 65 7 10 11 18 13 19 34 21 35 25 8 37 66 41 12 67 69 14 20 49 15 73 22 36 23 26 38 81 27 68 39 42 29 97 43 70 16 50 45 71 74 51 24 75 53 82 28 77 57 40 83 30 98 85 31 44 99 46 72 89 52 101 47 76 105 54 55 78 84 58 113 79 86 59 32 100 87 61 90 102 48 91 103 93 56 106 107 80 60 114 109 88 115 62 63 117 92 104 121 94 95 108 110 116 111 64 118 119 122 96 123 125 112 120 124 126 127 128

Further, another embodiment of the present invention will be described concretely with reference to <Table 24>. The target bit error rate (target block error rate) is 4%, and the code length is 128, the optimized bit channel index sequence can be illustrated as shown in Table 24 below. In addition, the numbers shown in Table 24 below are values indicative of the bit index of the polar sign, and the least significant bit index follows from 1. The following sequence is recorded from the channel having the bad channel to the channel having the good channel according to the channel status. A sequence of length N = 128 listed in Table 24 is used for encoding and decoding of a polar code having a code size of 128 and a sequence of lengths longer than 128, for example, N = 256, 512, and 1024 length sequences It can be used as a subset. Also, values from 1 to 64 can be used as a subset of the longer length sequence during N = 128 sequences in Table 23 below. Also, a value of 65 to 128 of N = 128 sequences in Table 23 below can be used as a subset of a longer length sequence. That is, the order of the numbers 1 to 128 on the long sequence is to follow the order of <Table 22>.

1 2 3 5 9 17 33 4 6 65 7 10 11 18 13 19 34 21 35 25 8 37 66 41 12 67 69 14 20 49 15 73 22 36 23 26 38 81 27 68 39 42 29 97 43 70 16 50 45 71 74 51 24 75 53 82 28 77 57 40 83 30 98 85 31 44 99 46 72 89 52 101 47 76 105 54 55 78 84 58 113 79 86 59 32 100 87 61 90 102 48 91 103 93 56 106 107 80 60 114 109 88 115 62 63 117 92 104 121 94 95 108 110 116 111 64 118 119 122 96 123 125 112 120 124 126 127 128

Other embodiments of the present invention will be described in detail with reference to Table 25. If the target block error rate is 5% and the code length is 256, the optimized bit channel index sequence can be exemplified as shown in Table 25 below. Also, the numbers illustrated in Table 25 below are values indicating the bit index of the polar sign, and the least significant bit index follows from 1. The sequence of Table 25 below is recorded from a bad channel to a good channel according to a polarized sub-channel condition. A sequence of length N = 256 listed in Table 25 is used for encoding and decoding of a polar code having a code size of 256, and a polar code sequence having a length longer than 256, for example, N = 512 and 1024 length sequences It can be used as a subset. The N = 256 sequences in Table 25 below can be used as a subset of the longer length sequence from 129 to 256. That is, according to the present embodiment, the order of the numbers 129 to 256 on the sequence longer than 256 is set to follow the order of Table 25.

Further, another embodiment of the present invention will be described concretely with reference to <Table 26>. The target bit error rate (target block error rate) is 2%, and the code length is 128, the optimized bit channel index sequence can be illustrated as shown in Table 26 below. In addition, the numbers shown in Table 26 are values indicating the bit index of the polar sign, and the least significant bit index follows from 1. The sequence shown in Table 26 is a recording of a channel having a bad channel to a good channel according to a polarized sub-channel state. A sequence of length N = 128 listed in Table 26 below is used for encoding and decoding of a polar code having a code size of 128, and a polar code sequence having a length longer than 128, for example, N = 256, 512, Lt; / RTI &gt; The N = 128 sequences of Table 26 below can be used as a subset of longer length sequences from 65 to 128. That is, according to the present embodiment, the sequence of numbers 65 to 128 on the sequence longer than 128 is made to follow the order of Table 26. [

Further, another embodiment of the present invention will be described concretely with reference to <Table 27>. The target bit error rate (target block error rate) is 3%, and the code length is 128, the optimized bit channel index sequence can be illustrated as shown in Table 27 below. In addition, the numbers shown in Table 27 are values indicating the bit index of the polar sign, and the least significant bit index follows from 1. The sequence shown in Table 27 is a recording of channels from bad channels to good channels according to a polarized sub-channel state. A sequence of length N = 128 listed in Table 27 below is used for encoding and decoding of a polar code having a code size of 128, and a sequence of lengths longer than 128, for example, N = 256, 512, Lt; / RTI &gt; A N = 128 sequence of Table 27 below can be used as a subset of a longer sequence of lengths from 65 to 128. That is, according to the present embodiment, the order of the numbers 65 to 128 on the sequence longer than 128 is set to follow the order of Table 27.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed. Accordingly, the scope of the present invention should be construed as being included in the scope of the present invention, all changes or modifications derived from the technical idea of the present invention.

100, 101, 102, 103, 104, 105, 106, 107: Available channels
418, 414, 424, 425, 426, 427, 428, 428, 431, 521, 522, 523: channel index
110, 120, 130, 140: Optimized bit channel index sequence
200: Optimized last bit channel index sequence
701: Control section 703: Memory
705: polar coder 707: transmitter / receiver

Claims (26)

A method for generating a sequence for a polar sign,
Designing each optimized polar sign sequence for a plurality of code rates for polar coding;
Sequentially arranging from a bit channel index having the worst channel state to a bit channel index having the best channel state for each of the plurality of code rates in a descending sequence; And
And generating a sequence for polar coding by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence,
And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted And sequentially inserting the bit stream into a lower bit channel index. CLAIMS 1. A method for transmitting data in a polarity encoding scheme in a communication system,
Determining a length of data to be transmitted, a code rate of a polarity code and a target error rate when a predetermined data transmission is requested;
Selecting a polar encoding sequence corresponding to the determined length of data to be transmitted, a code rate of a polarity code and a target error rate;
Performing polar coding using the selected polarizing sequence; And
And transmitting the pole-encoded data,
Wherein the polarity encoding sequence comprises:
Designing each optimized polarity code sequence for a plurality of code rates for a plurality of code rates, and for each of the plurality of code rates, from a bit channel index having the worst channel state to a bit channel index having the best channel state And a sequence for polar coding is generated by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence, ,
And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted Wherein the sequence is generated by sequentially inserting a lower bit channel index into a lower bit channel index. 3. The method of claim 2, wherein the last bit channel index sequence has a last bit channel index sequence of Table 28 and Table 28 when the predetermined target error rate is 10%
[Table 28]

[Table 28b]

Table 28 and Table 28b are sequences in which the numbers in Table 28b are consecutive after the consecutive number in Table 28 and Table 28 and Table 28 And the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the order of reading is poor from the upper left side of the table in the descending order of the table, / RTI &gt; 3. The method of claim 2, wherein the last bit channel index sequence has a final bit channel index sequence of Table 29 and Table 29 when the predetermined target error rate is 1%
[Table 29]

[Table 29b]

Table 29 and Table 29b are consecutive sequences of numbers in Table 29b after consecutive numbers in Table 29 and Table 29b and Table 29b are sequences in which the numbers in Table 29b are consecutive. &Gt; is a channel index value, and the channel index value is a sequence having a descending order from a channel in which the channel is in an improper order to a channel in which the order is poor from the upper left side of the table. In a communication system, / RTI > 3. The method of claim 2, wherein the last bit channel index sequence has a final bit channel index sequence of Table 30 and Table 30 below when the preset target error rate is 0.1%
[Table 30]

[Table 26b]

The following Table 30 and Table 30b are consecutive sequences of numbers in Table 30b after consecutive numbers in Table 30 and Table 30 and Table 30b represent consecutive numbers, 30b &gt; are channel index values, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally in the horizontal direction from the upper left corner of the table. In the communication system, A method for transmitting data. 3. The method of claim 2, wherein the final bit channel index sequence is one of the following Table 31 and Table 31b if the predetermined target error rate is 1% and the total code length is 1536,
Coding is performed with N = 1024 length (2 ¹⁰ ) using the following Table 31 and Table 31b, and again using the polar codelength N = 512 (25) And further transmission is repeated,
[Table 31]

[Table 31b]

Table 31 and Table 31b are sequences in which the numbers in Table 31b are consecutive after the consecutive number of Table 31 and Table 31 and Table 31 &Gt; is a channel index value, and the channel index value is a sequence having a descending order of channels in which channels are inadequately read from a channel whose order is poor from the top left of the table. In a communication system, / RTI > 3. The method of claim 2, wherein the last bit channel index sequence further generates a last bit channel index sequence having a different length corresponding to a transmission length of data to be transmitted at a predetermined target error rate, A method for transmitting data. The method according to claim 6,
And at least one consecutive sequence of consecutive sequences of Table 32 to Table 36 or Table 37 and Table 37b according to the transmission length of data when the preset target error rate is 10%
Table 32 below shows an optimized bit channel index sequence when the length is 32 (2 ⁵ ), and Table 33 below shows an optimized bit channel index sequence when the length is 64 (2 ⁶ ) Is an optimized bit channel index sequence with a length of 128 (2 ⁷ ), and Table 35 below shows an optimized bit channel index sequence with a length of 256 (2 ⁸ ) 512 ^(29), if the channel index and the optimal bit sequence to <Table 37> and <Table 37b> is a length of a channel bit index sequence optimization case of 1024 (2 ^10), and,
[Table 32]

[Table 33]

[Table 34]

[Table 35]

[Table 36]

[Table 37]

[Table 37b]

The consecutive numbers in Table 32 to Table 36 are channel index values, and the channel index values are sequences having descending order from the channel in which the channels are not good to read from the top left to the top of the table , The number of consecutive numbers in the above Table 37 to Table 37b is a sequence of consecutive numbers in Table 37b after Table 37, 37b &gt; is a channel index value, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading order is horizontally from the upper left corner of the table to the descending order. A method for transmitting data. The method according to claim 6,
And at least one consecutive sequence of consecutive sequences of Table 38 to Table 42 or Table 43 and Table 43b according to the data transmission length when the preset target error rate is 1%
Table 38 below shows an optimized bit channel index sequence with a length of 32 (2 ⁵ ), and Table 39 below shows an optimized bit channel index sequence with a length of 64 (2 ⁶ ) Is an optimized bit channel index sequence with a length of 128 (2 ⁷ ), and Table 41 below shows an optimized bit channel index sequence with a length of 256 (2 ⁸ ) 512 (2 ⁹ ), and the following Table 43 and Table 43b are optimized bit channel index sequences when the length is 1024 (2 ¹⁰ )
[Table 38]

[Table 39]

[Table 40]

[Table 41]

[Table 42]

[Table 43]

[Table 43b]

The consecutive numbers in Table 38 to Table 42 are channel index values, and the channel index values are sequences having descending order from the channel in which channels are not good to read in the order from the upper left corner of the table , The consecutive numbers of the above Table 43 to Table 43b are sequences of consecutive numbers in Table 43b and Table 43b and Table 43b, 43b &gt; are channel index values, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading order is horizontally from the upper left corner of the table to the descending order. A method for transmitting data. 8. The method of claim 7,
And at least one consecutive sequence of consecutive sequences of Table 44 to Table 47 or Table 48 and Table 48b for each data transmission length when the preset target error rate is 0.1%
Table 44 below shows an optimized bit channel index sequence for a length of 64 (2 ⁶ ), and Table 45 below shows an optimized bit channel index sequence for a length of 128 (2 ⁷ ) Is an optimized bit channel index sequence when the length is 256 (2 ⁸ ), and Table 47 below shows an optimized bit channel index sequence when the length is 512 (2 ⁹ ) 48b &gt; is an optimized bit channel index sequence for a length of 1024 (2 &lt; ¹⁰ &gt;),
[Table 44]

[Table 45]

[Table 46]

[Table 47]

[Table 48]

[Table 48b]

The consecutive numbers in Table 44 to Table 47 are channel index values and the channel index value is a sequence having descending order from the channel in which the channels are not good to read in the order from the upper left corner of the table , The consecutive numbers of the above Table 48 to Table 48b are sequences of the number of consecutive numbers of Table 48b after Table 48 and Table 48 48b > is a channel index value, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally from the upper left side of the table to the lower side. A method for transmitting data. An apparatus for transmitting data in a coding system in a communication system,
A transceiver for transmitting / receiving data encoded in a polar coding scheme through a radio channel band;
A memory for storing a polar encoding sequence;
A polarizer for polarizing the data to be transmitted using the polar encoding sequence stored in the memory; And
Determining a length of the data to be transmitted, a code rate of a polarity code and a target error rate, selecting a polarity encoding sequence corresponding to the determined length of the data to be transmitted, the code rate of the polarity code and the target error rate, And a control unit for controlling the polar encoding using the selected polarizing sequence and controlling transmission of the polarized encoded data,
Wherein the polar encoding sequence stored in the memory comprises:
The method comprising the steps of: designing each optimized pole sequence with respect to a plurality of code rates for polar coding; and selecting, from the bit channel index having the lowest channel state to the bit channel index having the best channel state, And a sequence for polar coding is generated by inserting a bit channel index selected for data transmission from the lowest code rate to the highest code rate among the plurality of code rates into a final bit channel index sequence, ,
And when the bit channel index selected for transmission at each code rate is inserted into the last bit channel index sequence, a remaining bit channel index excluding the bit channel index at the same position as the bit channel index previously inserted in the last bit channel index sequence is inserted Which is a sequence generated by sequentially inserting a lower bit channel index into a lower bit channel index, in a communication system. 12. The method of claim 11, wherein the polar encoding sequence stored in the memory comprises:
And has a final bit channel index sequence of Table 49 and Table 49b when the predetermined target error rate is 10%
[Table 49]

[Table 49b]

Table 49 and Table 49b are sequences in which the numbers in Table 49b are consecutive after the consecutive number in Table 49 and Table 49 and Table 49 And the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the order of reading is poor from the upper left side of the table in the descending order of the table, . 12. The method of claim 11, wherein the last bit channel index sequence has a final bit channel index sequence of Table 50 and Table 50 below when the predetermined target error rate is 1%
[Table 50]

[Table 50b]

Table 50 and Table 50b are consecutive sequences of numbers in Table 50b after consecutive numbers in Table 50 and Table 50b and Table 50b are sequences in which the numbers in Table 50b are consecutive. &Gt; is a channel index value, and the channel index value is a sequence having a descending order from a channel in which the channel is in an improper order to a channel in which the order is poor from the upper left side of the table. In a communication system, . 12. The method of claim 11, wherein the last bit channel index sequence has a final bit channel index sequence of Table 51 and Table 51 when the predetermined target error rate is 0.1%
[Table 51]

[Table 51b]

Table 51 and Table 51b are sequences in which the numbers in Table 51b are consecutive after the number of consecutive numbers in Table 51 and Table 51 and Table 51 &Gt; is a channel index value, and the channel index value is a sequence having a descending order of channels in which channels are inadequately read from a channel whose order is poor from the top left of the table. In a communication system, . 12. The method of claim 11, wherein the final bit channel index sequence is an optimized bit channel index sequence in Table 52 and Table 52 if the predetermined target error rate is 1% and the total code length is 1536,
The coding is performed with N = 1024 length (2 ¹⁰ ) using the following Table 52 and Table 52b, and again with the polarity code N = 512 (2 ⁵ ) In this case,
[Table 52]

[Table 52b]

Table 52 and Table 52b are sequences of consecutive numbers in Table 52b after consecutive numbers in Table 52 and Table 52b and Table 52b are sequences in which the numbers in Table 52b are consecutive, 52b &gt; are the channel index values, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally in the horizontal direction from the upper left corner of the table. Transmitting device. 12. The method of claim 11,
Wherein the last bit channel index sequence stored in the memory further comprises a last bit channel index sequence having a different length corresponding to a transmission length of data to be transmitted per predetermined target error rate, . 17. The method of claim 16,
And at least one consecutive sequence of consecutive sequences of Table 53 to Table 57, Table 58 and Table 58b for each data transmission length when the preset target error rate is 10%
Table 53 below shows an optimized bit channel index sequence when the length is 32 (2 ⁵ ), and Table 54 below shows an optimized bit channel index sequence when the length is 64 (2 ⁶ ) Is an optimized bit channel index sequence when the length is 128 (2 ⁷ ), and Table 56 below shows an optimized bit channel index sequence when the length is 256 (2 ⁸ ) 512 (2 ⁹ ), and the following Table 58 and Table 58b are optimized bit channel index sequences when the length is 1024 (2 ¹⁰ )
[Table 53]

[Table 54]

[Table 55]

[Table 56]

[Table 57]

[Table 58]

[Table 58b]

The consecutive numbers in the above Tables 53 to 56 are channel index values and the channel index values are sequences having descending order from the channel in which channels are not good to read in the order from the upper left corner of the table , The number of consecutive numbers of the above Table 58 to Table 58b is a sequence of consecutive numbers in the order of Table 58b and Table 58b and Table 58b, 58b &gt; is a channel index value, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally from the upper left side of the table to the lower side. Transmitting device. 17. The method of claim 16,
And at least one consecutive sequence of consecutive sequences of Table 59 to Table 63 or Table 64 and Table 64b for each data transmission length when the preset target error rate is 1%
Table 59 below shows an optimized bit channel index sequence when the length is 32 (2 ⁵ ), and Table 60 below shows an optimized bit channel index sequence when the length is 64 (2 ⁶ ) Is an optimized bit channel index sequence when the length is 128 (2 ⁷ ), and Table 62 below shows an optimized bit channel index sequence when the length is 256 (2 ⁸ ) 512 (2 ⁹ ), and the following Table 64 and Table 64b show an optimized bit channel index sequence when the length is 1024 (2 ¹⁰ )
[Table 59]

[Table 60]

[Table 61]

[Table 62]

[Table 63]

[Table 64]

[Table 64b]

The consecutive numbers in the above Tables 59 to 63 are channel index values and the channel index values are sequences having descending order from the channel in which the channels are not good to read in the order from the upper left corner of the table , The number of consecutive numbers of the above Table 64 to Table 64b is a sequence of consecutive numbers of the numbers of Table 64b after Table 64, 64b &gt; is a channel index value, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally in the horizontal direction from the upper left corner of the table. Transmission of data. 17. The method of claim 16,
And at least one consecutive sequence of consecutive sequences of Table 65 to Table 68, Table 69 and Table 69b for each data transmission length when the preset target error rate is 0.1%
Table 65 below shows an optimized bit channel index sequence when the length is 64 (2 ⁶ ), and Table 66 below shows an optimized bit channel index sequence when the length is 128 (2 ⁷ ) Is an optimized bit channel index sequence when the length is 256 (2 ⁸ ), and Table 68 is an optimized bit channel index sequence when the length is 512 (2 ⁹ ), and Table 69 69b &gt; is an optimized bit channel index sequence when the length is 1024 (2 &lt; ¹⁰ &gt;),
[Table 65]

[Table 66]

[Table 67]

[Table 68]

[Table 69]

[Table 69b]

The consecutive numbers in Table 65 to Table 67 are channel index values and the channel index value is a sequence having descending order from the channel having the worse order to the channel having the worse order to read horizontally from the upper left corner of the table , The number of consecutive numbers of the above Table 69 to Table 69b is a sequence of consecutive numbers of the number of Table 69b after Table 69 and Table 69 69b > is a channel index value, and the channel index value is a sequence having a descending order of the order in which the channel is improved from a channel in which the reading is horizontally from the upper left side of the table to the lower side. A method for transmitting data. The method according to claim 1,
And a sequence generated by the sequence generation method. 3. The method of claim 2, wherein the last bit channel index sequence has a final bit channel index sequence of Table 70 below if the predetermined target error rate is 2% and the code length is 64,
[Table 70]

Wherein the number of consecutive numbers in Table 70 is a channel index value and the channel index value is a sequence having descending order of channels from good channels to bad channels. 3. The method of claim 2, wherein the final bit channel index sequence has a final bit channel index sequence of Table 71, which is optimized if the preset target error rate is 5% and the code length is 128,
[Table 71]

Wherein the number of consecutive numbers in Table 71 is a channel index value and the channel index value is a sequence having descending order of channels from good channels to bad channels. 3. The method of claim 2, wherein the last bit channel index sequence has a final bit channel index sequence of Table 72, which is optimized when the preset target error rate is 4% and the code length is 128,
[Table 72]

Wherein the number of consecutive numbers in Table 72 is a channel index value and the channel index value is a sequence having descending order of channels from good channels to bad channels. 12. The method of claim 11, wherein the final bit channel index sequence has a final bit channel index sequence of Table 73, which is optimized when the predetermined target error rate is 2% and the code length is 64,
[Table 73]

Wherein the number of consecutive numbers in Table 73 is a channel index value and the channel index value is a sequence having descending order of channels from good channels to bad channels. 12. The method of claim 11, wherein the final bit channel index sequence has a final bit channel index sequence of Table 74, which is optimized if the preset target error rate is 5% and the code length is 128,
[Table 74]

Wherein the number of consecutive numbers in Table 74 is a channel index value and the channel index value is a sequence having descending order of a channel having a good channel state and a descending channel having a bad channel state. 12. The method of claim 11, wherein the final bit channel index sequence has a final bit channel index sequence as shown in Table 75 below if the preset target error rate is 4% and the code length is 128,
[Table 75]

Wherein the number of consecutive numbers in Table 75 is a channel index value and the channel index value is a sequence having descending order of channels from good channels to bad channels.

Images