KR101996026B1 - Apparatus and method for constructing rate-compatible polar code - Google Patents

Abstract

The present invention provides a method for configuring a polar code having code rate compatibility and an apparatus therefor. According to the present invention, the method comprises the steps of: determining a mutual puncturing pattern that equals an index of a channel to be punctured and an index of a channel whose polarized channel capacity is zero; and constructing a polar code having code rate compatibility based on the determined mutual puncturing pattern.

Description

[0001] The present invention relates to a method and apparatus for constructing a polarity code having code rate compatibility,

The present disclosure relates to a method and apparatus for constructing code symbols having code rate compatibility.

The polar code is an optimized code that can obtain the channel capacity by using the successive cancellation (SC) decoder in binary-input discrete memoryless channels (BI-DMCs) when the theoretical length is infinitely long. For finite length coding lengths, the list-SC (LSC) decoder approaches the optimized performance of the maximum-likelihood (ML) decoder. It also shows better performance over shorter lengths than optimized LDPC and Turbo codes by concatenating simple CRC codes.

The polar sign of a common length does not satisfy the condition of rate-compatible. The puncturing method is the most widely used method for designing a code having compatibility with current code rate. The puncturing method is a method of appropriately selecting the coded bits and not transmitting them. At this time, the puncturing rule is called puncturing pattern, and this pattern is currently selected empirically. There are many researches on the method of determining the puncturing pattern, and methods for optimizing the information bit set according to the puncturing pattern are being studied. Where the information bit set includes the index of the polarized channels transmitting the information bits.

 In recent years, a method of optimizing information bit sets and puncturing patterns has been proposed, which is a method of finding information bit sets according to each pattern. We start from the exhaustive search method which directly finds the number of cases of all possible patterns and use the symmetric property of the polar code encoder to effectively reduce the search space. This approach achieves optimized frame-error-rate (FER) performance, but is not available because of its high complexity. Although lower-complexity optimization algorithms have emerged, this method can not be applied to pole-codes with code-rate compatibility. In general, since the optimized information bit set according to each puncturing pattern is different from each other, the information bit set depending on the puncturing pattern can not be applied to a code having a code rate compatibility. All punctured polar codes in code-compatible polar codes must have the same set of information bits in the mother code. In other words, the proposed puncturing methods are not suitable for the design of variable code rate poles. Although it is possible to find an optimized set of information bits according to each puncturing pattern, it can not be applied to variable code rate codes that have the same set of information bits at all coding rates.

According to these embodiments, a method and apparatus for constructing code polynomials having code rate compatibility are provided. Also, the present invention proposes a reciprocal puncturing pattern, and proposes a method of constructing a polarity code having a code rate compatibility with an excellent performance by using the same.

According to a first aspect, a method of constructing a rate-compatible polar code is to use a reciprocal puncturing pattern that makes the index of the channel with the polarized channel capacity equal to 0 equal to the index of the bit to be punctured Determining; And constructing a polarity code having the code rate compatibility based on the determined mutual puncturing pattern.

In addition, the step of determining the reciprocal puncturing pattern may determine the reciprocal puncturing pattern by considering a first condition for puncturing bits corresponding to the first index.

In addition, the step of determining the mutual puncturing pattern may include: if the index of a bit to be punctured is expressed in binary, a bit corresponding to an index obtained by changing 1 to 0 in an index expressed in binary form It is possible to determine the mutual puncturing pattern by further considering the second condition that is the object of puncturing.

In addition, the step of constructing the polarity code having compatibility with the code rate may form a polarity code according to a mutual puncturing pattern for each of different code rates.

In addition, the step of constructing the polarity code having the code rate compatibility may include the same information bit set for each of the different code rates.

In addition, the step of constructing the polarity code having the code rate compatibility may include: determining a set orthogonal to the hamming weight among bins represented by the information bit set; And determining an index sequence of bits to be punctured based on the determined set; And constructing a code rate compatible code based on the determined index sequence.

According to a second aspect, there is provided an apparatus for constructing a polarity code having rate-compatibility, the apparatus comprising: a memory for storing one or more instructions; And executing the one or more instructions to determine a reciprocal puncturing pattern that makes the index of the channel with the polarized channel capacity equal to 0 equal to the index of the punctured bit, and based on the determined reciprocal puncturing pattern, Lt; RTI ID = 0.0 > rate-compatible. ≪ / RTI >

According to a third aspect, there is provided a computer-readable recording medium storing a program for implementing a method for constructing a polarity code having rate-compatible, the method comprising: Determining a reciprocal puncturing pattern to equalize the index of the channel to be punctured and the index of the bit to be punctured; And constructing a polarity code having the code rate compatibility based on the determined mutual puncturing pattern.

According to a fourth aspect, there is provided a computer program stored on a medium for executing a method of constructing a polarity code having rate-compatible, in combination with hardware, said method comprising the steps of: Determining a reciprocal puncturing pattern that makes the index of the channel to be punctured equal to the index of the punctured bit; And constructing a polarity code having the code rate compatibility based on the determined mutual puncturing pattern.

According to embodiments of the present invention, a method of determining a reciprocal puncturing pattern is provided, so that the influence of puncturing patterns on a given set of information bits can be accurately predicted. Also, it is possible to provide an algorithm for efficiently designing a code rate compatible code based on a reciprocal puncturing pattern. Thus, the information bit set and puncturing pattern can constitute pole codes having optimized code rate compatibility.

The present invention may be readily understood by reference to the following detailed description and the accompanying drawings, in which reference numerals refer to structural elements.
Figure 1 shows a polar encoder according to one embodiment.
Figure 2 shows an apparatus for constructing a polar sign, according to one embodiment.
FIG. 3 shows an embodiment of the puncturing pattern and the polarized channel capacity at P ² .
Figure 4 shows an embodiment of a reciprocal puncturing pattern.
5 shows a wireless communication system according to one embodiment.
6 is a view for explaining a method of constructing a polarity code having code rate compatibility according to an embodiment.

Although the terms used in the present embodiments have been selected in consideration of the functions in the present embodiments and are currently available in common terms, they may vary depending on the intention or the precedent of the technician working in the art, the emergence of new technology . Also, in certain cases, there are arbitrarily selected terms, and in this case, the meaning will be described in detail in the description part of the embodiment. Therefore, the terms used in the embodiments should be defined based on the meaning of the terms, not on the names of simple terms, and on the contents of the embodiments throughout.

In the descriptions of the embodiments, when a part is connected to another part, it includes not only a case where the part is directly connected but also a case where the part is electrically connected with another part in between . Also, when a component includes an element, it is understood that the element may include other elements, not the exclusion of any other element unless specifically stated otherwise.

It should be noted that the terms such as "comprising" or "comprising ", as used in these embodiments, should not be construed as necessarily including the various elements or steps described in the specification, Some steps may not be included, or may be interpreted to include additional components or steps.

The following description of the embodiments should not be construed as limiting the scope of the present invention and should be construed as being within the scope of the embodiments of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Exemplary embodiments will now be described in detail with reference to the accompanying drawings.

An encoder with a polar code generates a vector channel by properly combining the channels and separates them into new polarized channels. The channel capacities C (W) = 1 and C (W) for an infinite length channel, = 0. A bit with a channel capacity of 1 transmits an information bit because it does not generate an error and transmits a frozen bit known as a bit with a channel capacity of zero.

Figure 1 shows a polar encoder according to one embodiment.

In FIG. 1, a polar coder 10 having a code length of 2 according to an embodiment is shown, but the code length is not limited thereto. In FIG. 1, two channels of BI-DMCs (binary-input discrete memoryless channels) are combined to represent two channels repeatedly. 1, u ₀ and u ₁ are binary-input information bits, and y ₀ and y ₁ are coded output bits. When N channels are combined, they can be expressed in the same manner as in Fig. Because of this channel combining process, the code length can be N = 2 ⁿ (n is a natural number).

Figure 2 shows an apparatus for constructing a polar sign, according to one embodiment.

An apparatus 100 (hereinafter referred to as apparatus 100 for convenience) that constitutes a polarity code can constitute a polarity code having rate-compatible. Code rates - Compatible polar codes can mean applicable polar codes at different code rates. Also, a code-compatible polarity code may mean a polarity code having the same set of information bits.

The apparatus 100 may include a memory 110 and a processor 120. The device 100 shown in FIG. 2 is only shown in the components associated with these embodiments. Therefore, it is apparent to those skilled in the art that the apparatus 100 may further include general components other than the components shown in FIG.

The memory 110 is a hardware for storing various data processed in the apparatus 100, for example, the memory 110 may store data processed in the apparatus 100 and data to be processed.

Processor 120 is responsible for controlling overall functions for executing device 100. For example, processor 120 generally controls device 100 by executing one or more instructions or programs stored in memory 110 within device 100. The processor 120 may be implemented as a central processing unit (CPU), a graphics processing unit (GPU), an application processor (AP), or the like.

The processor 120 may determine a reciprocal puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the bits to be punctured.

B_P ^N is an index set of punctured bits, and D_P ^N is an index set of bits whose polarized channel capacity is zero. _{^{Here, P N = (P 0,}} P 1, ..., P N - 1) indicates the puncturing pattern when the code length N, P _i = 0 will have an i-bit position punctured, P _i = 1 Indicates that the i-bit digit is not punctured. For example, in the case of P ² = (0, 1), it means that the first bit in the polarity code of code length 2 is punctured. Therefore, the reciprocal puncturing pattern may mean a puncturing pattern satisfying B_P ^N = D_P ^N.

를 천공 패턴 P^N으로 행해졌을 경우의 i번째 극화된 채널 용량이라고 하는 경우, P²=(1,0)인 경우, 극화된 채널은

와 같다.Prior to the process of determining the reciprocal puncturing pattern by the processor 120, a change in the channel capacity due to the reciprocal puncturing pattern will be described. First, assuming that the symbol I (W _i ) is the capacity of the channel w _{i that} is polarized at the _ith channel, assuming that message transmission is performed in a perfect channel, I (W) = 1, bit channel punctured because it does not have I (W _i) = 0 channels that are to be (i is an element of B_P ^N), is not punctured bit is seen that a transmission with no channel noise, I (W _i) = 1 ( i is an element not corresponding to B_P ^N ). Also,

Is the i-th polarized channel capacity when it is performed with the puncturing pattern P ^N , if P ² = (1, 0), the polarized channel is

.

FIG. 3 shows an embodiment of the puncturing pattern and the polarized channel capacity at P ² .

Referring to FIG. 3, if the puncturing pattern is (0, 0), all the bits of the input are punctured. If the puncturing pattern is (0, 1), since only the first bit is punctured, only the first bit of the input channel capacity is zero. When the puncturing pattern is (1, 0), the channel capacity becomes 0 only in the first bit. (1, 1), since the code has no puncturing, the capacity of all the input channels becomes 1. Referring to FIG. 3, the channel capacity of each polarized channel may be expressed by Equation (1).

를 블리안 함수(Boolean function)로 하기 수학식 2와 같이 나타낼 수 있다.Using the above equation ( ₁ ), when P ² = (p ₀ , p ₁ )

Can be expressed as a Boolean function as shown in Equation (2) below.

'는 AND 연산 부호를 나타내고, '

'는 OR 연산 부호를 나타낸다. 이러한 블리안 함수를 적용하고, 채널 용량이 0이 되는 규칙을 통해 상호적 천공 패턴이 정해질 수 있다.In Equation (2), "

'Denotes an AND operation code, and'

'Denotes an OR operation code. By applying such a Brillian function, a reciprocal puncturing pattern can be determined through a rule that the channel capacity becomes zero.

Referring again to FIG. 2, the processor 120 may consider the following two conditions to determine a reciprocal puncturing pattern.

First condition -

Second condition -

에 0이 포함된다는 의미인 바, 상호적 천공 패턴에 첫 번째 인덱스에 해당하는 비트를 포함시켜야 한다는 의미이다. 또한, 제 2 조건에서,

는 2진(binary)로 표현되는 j 인덱스에서 숫자 1을 갖는 위치와 대응되는, i 인덱스에서의 위치의 숫자는 1이 되어야 한다는 의미이다. 다시 말해, 제 2 조건은, 천공의 대상이 되는 비트의 인덱스가 2진으로 표현되는 경우, 2진으로 표현된 인덱스에서 1을 0으로 변경한 인덱스에 해당하는 비트가 천공의 대상이 된다는 의미이다. 또한, 제 2 조건에 따르면,

인 경우, i > 0인 모든 수에 대해 성립할 수 있다. 예를 들어, 100₍₂₎

₁ j 라면 j는 100₍₂₎에서 1이 있는 자리를 1 또는 0으로 바꾼 100₍₂₎, 000₍₂₎ 일 경우에만 만족한다. 따라서, 프로세서(120)는 제 1 조건 및 제 2 조건을 만족하는 천공 패턴을 상호적 천공 패턴으로 결정할 수 있다.The first condition is the index set of bits to be punctured

Means that the bit corresponding to the first index should be included in the reciprocal puncturing pattern. Further, in the second condition,

Means that the number of positions in the i-th index corresponding to positions having the number 1 in the j-index expressed in binary must be 1. In other words, the second condition means that if the index of the bit to be punctured is expressed in binary, the bit corresponding to the index changed from 1 to 0 in the binary-represented index is punctured . Further, according to the second condition,

, It can be established for all numbers of i> 0. For example, 100 ₍₂₎

₁ j if j satisfies only 100 ₍₂₎ 100 ₍₂₎ changing the position that is 1 in the 1 or 0, 000 ₍₂₎ days. Accordingly, the processor 120 can determine the puncturing pattern that satisfies the first condition and the second condition as a mutual puncturing pattern.

Figure 4 shows an embodiment of a reciprocal puncturing pattern.

Referring to FIG. 4, if binary index bits of 000, 001, 100, and 101 are punctured, the binary index bits of 000, 001, 100, and 101 satisfy the first condition and the second condition described above, It can be a red perforation pattern. If, in other cases, the binary index bits of 000, 101 are punctured, the binary index bits of 000, 101 are mutually exclusive because they satisfy the first condition by 000 but do not satisfy the second condition by 101 It can not be a puncture pattern. In this case, the binary index bits of 100, 001 by 101 must be punctured to satisfy the second condition, and the 100, 001 binary index bits must also be punctured to satisfy the reciprocal puncturing pattern.

Referring again to FIG. 2, the processor 120 may construct a code rate compatible code based on a reciprocal puncturing pattern. In particular, the processor 120 may construct a polar sign according to a mutual puncturing pattern for each of the different coding rates. In other words, the processor 120 may construct a set of reciprocal puncturing patterns having code rate-compatibility. Also, the polar sign constructed for each of the different code rates may comprise the same set of information bits.

First, the processor 120 may determine a set orthogonal to a hamming weight of indices represented by binary numbers based on a set of information bits, and determine an index sequence of bits to be punctured based on the determined set You can decide. Next, the processor 120 may construct a code rate compatible code based on the determined index sequence.

은 마더(mother) 코드 길이인

을 목표 부호율

에 맞도록 천공하는 천공 패턴이다. 또한,

은 천공되는 자리의 인덱스 집합이며,

는 천공되는 비트의 숫자이다. 먼저, 프로세서(120)는 상호적 천공 패턴을 만족하는

을 결정할 수 있다. 이어서, 프로세서(120)는

의 천공 패턴에

의 추가 천공 비트의 위치들만 더하여

를 구성할 수 있다.According to one embodiment, the processor 120 may set M different rates R ₁ , R ₂ , ..., R _M. Here, it is assumed that M different code rates have a magnitude relation of R ₁ > R ₂ >...> R _M , and M different code rates can be input by the outside. in this case,

Is the mother code length

Target code rate

And the perforation pattern is a perforation pattern. Also,

Is a set of indexes of punctured positions,

Is the number of bits to be punctured. Initially, the processor 120 determines whether to satisfy a reciprocal puncturing pattern

Can be determined. The processor 120 then

In the perforation pattern of

Lt; RTI ID = 0.0 >

.

에 대해,

는

를 만족하는 경우를 의미하며, 여기서

는 해밍 무게(hamming weight)(예를 들어,

은

에 포함된 1의 개수)를 의미하고,

는 i번째 인덱스를 2진 인덱스로 표현한 함수를 의미하고,

는 2진 덧셈을 의미한다. 또한, 인덱스 집합

,

와 앞서 정의된 함수를 이용하여 하기 수학식 3과 같이

연산을 정의할 수 있다.Before looking at a specific example,

About,

The

, ≪ / RTI > where < RTI ID =

Quot; refers to a hamming weight (e.g.,

silver

The number of " 1 " included in "

Denotes a function representing an i-th index as a binary index,

Means binary addition. Also,

,

≪ EMI ID = 3.0 >

Operations can be defined.

을 기준으로, 하기 수학식 3에 따라, 이진수로 표현된 인덱스들 중 해밍 무게에 대하여 직교하는 집합

(단, i=0,...,n)을 결정할 수 있다.Processor 120 may generate a set of information bits

, A set that is orthogonal to the Hamming weight among the indices represented by the binary number according to the following equation (3)

(Where i = 0, ..., n).

In Equation (3), j = 2, ..., n.

의 시퀀스를 하기 수학식 4와 같이, 천공되는 비트의 인덱스 시퀀스

로써 결정할 수 있다.The processor 120 then determines the length

As shown in Equation (4), the index sequence of the bit to be punctured

.

에 기초하여, 부호율-호환성을 갖는 극 부호를 구성할 수 있다. 구체적으로, 먼저, 프로세서(120)는

의 처음

개수의 원소를 취하여

를 구성할 수 있다.

를 구성함에 있어,

은 상호적 천공 패턴이 되고, 정보 비트 집합

를 손상시키지 않는다. 이어서, 프로세서(120)는

의 처음

개수의 원소를 취하여

를 구성할 수 있다. 이를 통해,

이 성립하여, 부호율-호환성이 만족된다. 마찬가지로, 프로세서(120)는

의 처음

개수의 원소를 취하여

를 구성할 수 있다. 만약,

인 경우, 부호율-호환성을 갖는 극 부호를 구성하지 못하므로, 가장 큰 부호율의 부호를 바꿔주어야 한다.The processor 120 then determines the index sequence < RTI ID = 0.0 >

, A polarity code having a code rate-compatibility can be constructed. Specifically, first, the processor 120

The beginning of

Take the number of elements

.

In this case,

Is a reciprocal puncturing pattern, and the information bit set

. The processor 120 then

The beginning of

Take the number of elements

. because of this,

And the code rate-compatibility is satisfied. Similarly, processor 120

The beginning of

Take the number of elements

. if,

, The polarity code having compatibility with the code rate can not be constructed, so the sign of the largest code rate should be changed.

이고, 정보 비트 집합

인 경우, 프로세서(120)는 하기 수학식 6에 따라, 인덱스 시퀀스

를 결정할 수 있다. For example, the code length

, An information bit set

, The processor 120 calculates the index sequence < RTI ID = 0.0 >

Can be determined.

이고, 정보 비트 집합

인 경우, 프로세서(120)는 하기 수학식 7에 따라, 인덱스 시퀀스

를 결정할 수 있다. As another example,

, An information bit set

, The processor 120 determines whether the index sequence < RTI ID = 0.0 >

Can be determined.

Through the example shown, it has been confirmed that the number of puncturing patterns can be varied by selection of the information bit set, and the processor 120, through the above-described method, sets the mutual puncturing pattern and the information bit set together, - It is possible to construct a polarity code having compatibility.

이고, 정보 비트 집합

이고, 서로 다른 부호율 R₁, R_2, R₃가 1/2, 2/7, 1/4인 경우, 프로세서(120)는 기 서술한 방법을 통해,

를 결정할 수 있다. 또한, 프로세서(120)는

로 결정할 수 있고, 결과적으로, 부호율-호환성을 갖는 극 부호를

와 같이 구성할 수 있다.As another example,

, An information bit set

And the different coding rates R ₁ , R _{2, and} R ₃ are 1/2, 2/7, and 1/4, the processor 120, through the method described above,

Can be determined. In addition, the processor 120

And as a result, the code rate-compatible polarity code can be determined

As shown in FIG.

5 shows a wireless communication system according to one embodiment.

The wireless communication system 1 may include a transmitting apparatus 200 and a receiving apparatus 300. According to one embodiment, the transmitting device 200 and the receiving device 300 may be user devices or network devices. The user equipment may include a terminal, a mobile station, user equipment, etc., and the network equipment may include a base station, a node B, an evolved node B, And the like.

The transmitting apparatus 200 can transmit a signal including data. The transmitting apparatus 200 may use various encoding and decoding techniques to increase the error rate performance of data that can be transmitted through a channel. According to one embodiment, the transmitting apparatus 200 can perform coding using a polar sign. In addition, the transmitting apparatus 200 can include the apparatus 100, and the transmitting apparatus 200 can constitute a code-compatible polar code and can perform coding using the configured polar code have. Further, the transmitting apparatus 200 can modulate the polar-encoded signal and transmit the modulated signal to the receiving apparatus 300. [

The receiving apparatus 300 can receive signals from the transmitting apparatus 200 and can modulate the signals. Then, the receiving apparatus 300 can perform decoding on the polar-encoded signal.

6 is a view for explaining a method of constructing a polarity code having code rate compatibility according to an embodiment.

The method shown in FIG. 6 may be performed by each component of the apparatus 100 of FIG. 2, and redundant description is omitted.

In step s610, the device 100 may determine a reciprocal puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the punctured bit.

Specifically, the apparatus 100 may determine the reciprocal puncturing pattern in consideration of a first condition for puncturing a bit corresponding to a first index. In addition, when the index of the bit to be punctured is expressed in binary, the device 100 determines whether the bit corresponding to the index obtained by changing 1 to 0 in the binary-represented index is the target of puncturing The mutual puncturing pattern can be determined in consideration of the second condition.

In step s620, the device 100 may construct a polarity code having code rate compatibility based on the determined mutual puncturing pattern. Specifically, the apparatus 100 may construct a polar sign according to a reciprocal puncturing pattern for each of the different coding rates. The polar sign for each of the different code rates may comprise the same set of information bits.

Specifically, the apparatus 100 may determine an orthogonal set of the indexes of the binary representations, based on the information bit set, that is orthogonal to the hamming weight, and determine, based on the determined set, The sequence can be determined. The device 100 may then construct a code rate compatible code based on the determined index sequence.

A server or an apparatus according to the above embodiments may include a processor, a memory for storing and executing program data, a permanent storage such as a disk drive, a communication port for communicating with an external device, a touch panel, a key, A user interface device such as a button, and the like. Methods implemented with software modules or algorithms may be stored on a computer readable recording medium as computer readable codes or program instructions executable on the processor. Here, the computer-readable recording medium may be a magnetic storage medium such as a read-only memory (ROM), a random-access memory (RAM), a floppy disk, a hard disk, ), And a DVD (Digital Versatile Disc). The computer-readable recording medium may be distributed over networked computer systems so that computer readable code can be stored and executed in a distributed manner. The medium is readable by a computer, stored in a memory, and executable on a processor.

This embodiment may be represented by functional block configurations and various processing steps. These functional blocks may be implemented in a wide variety of hardware and / or software configurations that perform particular functions. For example, embodiments may include integrated circuit components such as memory, processing, logic, look-up tables, etc., that may perform various functions by control of one or more microprocessors or other control devices Can be employed. Similar to how components may be implemented with software programming or software components, the present embodiments may be implemented in a variety of ways, including C, C ++, Java (" Java), an assembler, and the like. Functional aspects may be implemented with algorithms running on one or more processors. In addition, the present embodiment can employ conventional techniques for electronic environment setting, signal processing, and / or data processing. Terms such as "mechanism", "element", "means", "configuration" may be used broadly and are not limited to mechanical and physical configurations. The term may include the meaning of a series of routines of software in conjunction with a processor or the like.

The specific implementations described in this embodiment are illustrative and do not in any way limit the scope of the invention. For brevity of description, descriptions of conventional electronic configurations, control systems, software, and other functional aspects of such systems may be omitted. Also, the connections or connecting members of the lines between the components shown in the figures are illustrative of functional connections and / or physical or circuit connections, which may be replaced or additionally provided by a variety of functional connections, physical Connection, or circuit connections.

In this specification (particularly in the claims), the use of the terms "above" and similar indication words may refer to both singular and plural. In addition, when a range is described, it includes the individual values belonging to the above range (unless there is a description to the contrary), and the individual values constituting the above range are described in the detailed description. Finally, if there is no explicit description or contradiction to the steps constituting the method, the steps may be performed in an appropriate order. It is not necessarily limited to the description order of the above steps. The use of all examples or exemplary terms (e. G., The like) is merely intended to be illustrative of technical ideas and is not to be limited in scope by the examples or the illustrative terminology, except as by the appended claims. It will also be appreciated by those skilled in the art that various modifications, combinations, and alterations may be made depending on design criteria and factors within the scope of the appended claims or equivalents thereof.

Claims (9)

A method for constructing a polarity code having rate-compatible,
Determining a mutual puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the bit to be punctured; And
And constructing a polar sign having the code rate compatibility based on the determined mutual puncturing pattern,
Wherein determining the reciprocal puncturing pattern comprises:
A first condition for puncturing a bit corresponding to the first index and a second condition for puncturing a bit corresponding to an index obtained by changing 1 to 0 in an index expressed in binary when the index of a bit to be punctured is represented by binary Wherein the reciprocal puncturing pattern is determined in consideration of a second condition in which a bit is to be punctured. delete delete The method according to claim 1,
Wherein the step of constructing the polarity code having the code rate compatibility comprises:
And constructing a polar sign according to a reciprocal puncturing pattern for each of the different code rates. The method according to claim 1,
Wherein the step of constructing the polarity code having the code rate compatibility comprises:
Wherein the polar sign for each of the different code rates comprises the same set of information bits. A method for constructing a polarity code having rate-compatible,
Determining a mutual puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the bit to be punctured; And
And constructing a polar sign having the code rate compatibility based on the determined mutual puncturing pattern,
Wherein the step of constructing the polarity code having the code rate compatibility comprises:
Determining, based on the set of information bits, a set orthogonal to the hamming weight of bins represented by the binary; And
Determining an index sequence of bits to be punctured based on the determined set; And
And constructing a code rate compatible code based on the determined index sequence. In an apparatus constituting a polar sign having rate-compatible,
A memory for storing one or more instructions; And
Determining a reciprocal puncturing pattern that makes the index of the channel with the polarized channel capacity equal to 0 equal to the index of the punctured bit by executing the one or more instructions, and based on the determined reciprocal puncturing pattern, Comprising a processor, the processor comprising:
The processor comprising:
A first condition for puncturing a bit corresponding to the first index and a second condition for puncturing a bit corresponding to an index obtained by changing 1 to 0 in an index expressed in binary when the index of a bit to be punctured is represented by binary Wherein the reciprocal puncturing pattern is determined in consideration of a second condition in which a bit is to be punctured. A computer-readable recording medium having recorded thereon a program for implementing a method for constructing a polarity code having rate-compatibility,
The method comprises:
Determining a mutual puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the bit to be punctured; And
And constructing a polar sign having the code rate compatibility based on the determined mutual puncturing pattern,
Wherein determining the reciprocal puncturing pattern comprises:
A first condition for puncturing a bit corresponding to the first index and a second condition for puncturing a bit corresponding to an index obtained by changing 1 to 0 in an index expressed in binary when the index of a bit to be punctured is represented by binary Wherein the mutual puncturing pattern is determined in consideration of a second condition in which a bit becomes an object of puncturing. A computer program stored on a computer-readable medium for executing a method of constructing a polarity code having rate-compatible, in combination with hardware,
The method comprises:
Determining a mutual puncturing pattern that makes the index of the channel with the polarized channel capacity equal to zero equal to the index of the bit to be punctured; And
And constructing a polar sign having the code rate compatibility based on the determined mutual puncturing pattern,
Wherein determining the reciprocal puncturing pattern comprises:
A first condition for puncturing a bit corresponding to the first index and a second condition for puncturing a bit corresponding to an index obtained by changing 1 to 0 in an index expressed in binary when the index of a bit to be punctured is represented by binary Wherein the reciprocal puncturing pattern is determined in consideration of a second condition that a bit is a target of puncturing.

Images