Method and device for data transmission
By adopting the rate matching design of polarization encoding and PAC encoding in 5G mobile communication, the problem of poor performance of LDPC code in short payload size is solved, efficient transmission in different channel environments is achieved, and ultra-reliable and low-cost Delayed communication requirements.
Patent Information
- Application Number
- CN202280095148.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2022-11-01
- Publication Date
- 2024-12-03
AI Technical Summary
In the 5G mobile communication standard, low-density parity check (LDPC) codes perform poorly in terms of short payload sizes, and polarized codes require rate matching when transmitting payloads in different wireless channel environments, which is difficult for the prior art to meet the ultra-substance Reliable low-latency communication (URLLC) requirements.
Polarization encoding, PAC encoding or other pre-transformed polarization encoding schemes are adopted to optimize the code length and decoding complexity through rate matching design to achieve effective transmission in different channel environments. Specific methods include polarization transformation, rate configuration, convolution transformation and interleaving operations using a polarization matrix to match channel conditions.
Improves transmission performance in different wireless channel environments, meets the needs of ultra-reliable low-latency communication, and provides higher encoding gain and efficiency.
Smart Images

Figure CN119072903A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to channel coding technology in communication systems. Background Art
[0002] Mobile communication technology is driving the world towards an increasingly connected and networked society. Compared with existing wireless networks, next-generation systems and communication technologies will need to support a wider range of use case characteristics and provide more complex and advanced access requirements and flexibility.
[0003] Long Term Evolution (LTE) is a wireless communication standard for mobile devices and data terminals developed by the Third Generation Partnership Project (3GPP). LTE Evolution (LTE-A) is a wireless communication standard that is an enhanced version of the LTE standard. The fifth generation wireless system, or 5G, advances the LTE and LTE-A wireless standards and is committed to supporting higher data rates, a large number of connections, ultra-low latency, high reliability, and other emerging business requirements. Summary of the invention
[0004] The present invention discloses, among other things, techniques for rate matching design for polar coding, PAC coding, and / or other pre-transformed polar coding schemes.
[0005] In one example aspect, a first digital communication method is disclosed. The method includes determining, by a first node, an output bit sequence having E bits based on an input bit sequence c having K bits, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a portion of the bit sequence before the polarization transformation; and transmitting, by the first node to a second node, a signal including the output bit sequence.
[0006] In another example aspect, another wireless communication method is disclosed. The method includes receiving, by a second node, a signal including an output bit sequence having E bits from a first node; and determining, by the second node, an input bit sequence c having K bits based on the signal, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a portion of the bit sequence before the polarization transformation.
[0007] In another example aspect, a wireless communication device comprising processes configured or operable to perform the above method is disclosed.
[0008] In another exemplary aspect, a computer-readable storage medium is disclosed. The computer-readable storage medium stores codes, which, when executed by a processor, cause the processor to implement the above method. BRIEF DESCRIPTION OF THE DRAWINGS
[0009] Figure 1 The polarization matrix G is shown (32) Example of a factor graph for .
[0010] Figure 2A A schematic diagram showing polar coding with rate matching in the 3GPP 5G standard.
[0011] Figure 2B A schematic diagram of PAC encoding is shown.
[0012] Figure 3 A schematic diagram of a convolution transformation is shown, where the convolution vector g = [g0, g1, ..., g m ] or the convolution polynomial g(D)=g0+g1·D+…+g on GF(2) m-1 ·D m-1 +g m ·D m .
[0013] Figure 4A A first rate matching example of polar codes without pre-transformation and interleaving is shown.
[0014] Figure 4B A second rate matching example with interleaved polar codes is shown.
[0015] Figure 4C A third rate matching example with pre-transformed polar codes is shown.
[0016] Figure 4D A fourth rate matching example with pre-transformed and interleaved polar codes is shown.
[0017] Figure 4E A fifth rate matching example of polar codes without pre-transformation and interleaving is shown.
[0018] Figure 4F A sixth rate matching example with interleaved polar codes is shown.
[0019] Figure 4G A seventh rate matching example with pre-transformed polar codes is shown.
[0020] Figure 4H An eighth rate matching example with pre-transformed and interleaved polar codes is shown.
[0021] Figure 5 It is shown that the recursive feedback polynomial q(D)=q0+q1·D+…+q m-1 ·D m-1 +q m ·D m(or equivalently, the recursive feedback sequence q = [q0, q1, ..., q m ]) Schematic diagram of the pre-transformation defined, where q0=1.
[0022] Figure 6 A schematic diagram of a pre-transformation defined by both the generator polynomial g(D) and the recursive feedback polynomial q(D) is shown.
[0023] Figure 7 The block error rate of Example 1 on an AWGN channel is shown.
[0024] Figure 8 An exemplary block diagram of a hardware platform that may be part of a network device or a communication device is shown.
[0025] Fig. 9 An example of network communication including a base station (BS) and a user equipment (UE) based on some embodiments of the disclosed technology is shown.
[0026] Fig.10 is a flowchart representation of a method for digital communication according to one or more embodiments of the present application.
[0027] Fig.11 is a flowchart representation of another method for digital communication according to one or more embodiments of the present application. DETAILED DESCRIPTION
[0028] The titles of the following sections are used to facilitate understanding of the disclosed subject matter and do not limit the scope of the claimed subject matter in any way. Therefore, one or more features of one section may be combined with one or more features of another section. In addition, for clarity of explanation, 5G terminology is used, but the technology disclosed in this application is not limited to 5G technology and can be used in wireless systems implementing other protocols.
[0029] The present application discloses a method and an apparatus related to a rate matching scheme for pre-transformed polarization coding in a wireless communication system.
[0030] In the fifth generation (5G) mobile communication standard of the 3rd Generation Partnership Project (3GPP), low-density parity-check (LDPC) codes are used for data transmission. However, LDPC codes are inferior to polar codes in terms of short payload size, also known as transport block size (TBS). In addition, LDPC codes have a high error floor (block error rate (BLER) of 0.0001). In order to meet the future ultra-reliable low-latency communication (URLLC), we must design more powerful channel codes.
[0031] Polarization adjusted convolutional (PAC) codes can achieve finite length bounds at moderate decoding complexity. PAC codes are an innovation of polar codes. Therefore, the code length of PAC codes is the same as that of polar codes, which is a power of 2 (N = 2 n , where n is a positive integer). However, in order to effectively transmit the payload (or transport block (TB)) in different wireless channel environments, it is not always necessary to have N=2 in the time and frequency resources allocated by the base station (BS). n Therefore, the application of PAC code in wireless communication requires a rate matching scheme. In this application, a method and apparatus with good performance are proposed for the rate matching design of polarization coding, PAC coding or other pre-transformed polarization coding.
[0032] introduce
[0033] Notes
[0034] GF(2) represents a Galois field of size 2 having two elements "0" and "1".
[0035] br(i) is the bit reversal function.
[0036] floor(x) represents the largest integer not greater than x.
[0037] ceil(x) represents the smallest integer not less than x.
[0038] round(x) is a round function that rounds the integer closest to x, for example, round(3.2)=3, round(4.8)=5, round(2.5)=3, round(-1.9)=-2, round(-3.4)=-3.
[0039] max(x,y) represents the maximum value between x and y, that is
[0040] mod(x,y) represents the remainder when x is divided by y. For example, mod(5,3)=2 and mod(3,5)=3.
[0041] X i,j represents the element in the i-th row and j-th column of the matrix X, where bold uppercase letters are used to represent matrices.
[0042] [x0,x1,…,x Y-1 ] represents a sequence (or vector) of length Y, containing elements x0, x1, ..., x Y-1 The bold lowercase letter x is used to denote a sequence (or vector) [x0, x1, …, x Y-1 ].
[0043] {x0,x1,…,x Y-1} means there are Y different elements x0, x1, ..., x Y-1 The set of x, that is, for any i≠j, i ≠x j .
[0044] <x0,x1,…,x Y-1 > represents a number of Y different elements x0, x1, ..., x Y-1 An ordered set, that is, for any i≠j, x i ≠x j . Let X = <x0,x1,…,x Y-1 >, X(i) represents the i-th element x in the ordered set X i .
[0045] For a set X, |X| represents the size of the set, that is, the number of elements in set X.
[0046] Z N ={0,1,…,N-2,N-1} represents the set of integers containing all non-negative integers less than N.
[0047] Indexing of sequences, vectors, or matrices starts at zero.
[0048] Introduction to Polarization Matrix
[0049] This section introduces some concepts for using polarization matrices according to various embodiments.
[0050] We will G (N) It is represented as a polarization transformation matrix (or simply polarization matrix) with N rows and N columns, where N is a power of 2, that is, N=2 n , and n is a positive integer. n is called G (N) The order of the polarization matrix, and N is called G (N) The size of the polarization matrix, that is, G (N) The size of is N.
[0051] G (N) Can be one of the following:
[0052] ·
[0053] ·
[0054] ·G (N) =P (N) ;
[0055] ·G (N) =B (N) ·P(N) ;
[0056] Here, all matrix operations are over GF(2). For example, P (1) = [1], is the n-th Kronecker power of matrix P (2) , and B (N) is the bit-reversal permutation matrix with N rows and N columns, and 0 is the all-zero matrix with N / 2 rows and N / 2 columns.
[0057] Let be the element in the i-th row and j-th column of the bit-reversal permutation matrix B (N) . Then, for 0 ≤ i < N and 0 ≤ j < N, where br(i) is the bit-reversal function defined as , and [b n-1 , b n-2 , …, b1, b0] is the n-bit binary expansion of the integer i, i.e.,
[0058] The multiplication of a sequence (or vector) x of length N over GF(2) with the polarization matrix G (N) over GF(2) is called the polarization transform of the sequence (vector) x. It is denoted as y = x · G (N) , where the vector-matrix multiplication is over GF(2). Then, y is the polarization transform of x.
[0059] Figure 1 shows the factor graph of the polarization matrix G (32) of size N = 32, and the matrix G (32) is as follows:
[0060]
[0061] The polarization matrix G (32)
[0062] Introduction to 3GPP 5G Polarization Coding
[0063] Some exemplary embodiments using polarization coding according to the 3GPP 5G standard are disclosed in this section.
[0064] In the 3GPP 5G standard, polarization codes are used for control channel transmission. Figure 2A shows a schematic diagram of 5G polarization coding with rate matching.
[0065] Denote Q as the set of data bit indices of size K, i.e., |Q| = K, where Q is the set of integers Z N= a subset of {0, 1, …, N-2, N-1}. Then, using the polarization matrix G (N) for 5G polarization coding, encoding the input bit sequence c = [c0, c1, …, c K-2 , c K-1 into the output bit sequence e = [e0, e1, …, e E-2 , e E-1 includes the following operations, where K is the length of the input bit sequence, E is the length of the output bit sequence, K and E are positive integers, K < N and K < E.
[0066] As Figure 2A shown, there are 3 main steps involved in this process: adding frozen bits, polarization transformation, and rate matching. The rate matching step also includes sub-block interleaving and bit selection.
[0067] (1) Adding frozen bits: The operation of adding frozen bits combines N-K zero bits with the input bit sequence c to form a polarization transformation input sequence u = [u0, u1, …, u N-2 , u N-1 of length N according to the data bit index set Q.
[0068] The polarization transformation input sequence u is determined by the input bit sequence c, the data bit index set Q, and the polarization matrix size N, as follows:
[0069]
[0070] (2) Polarization transformation: The polarization transformation is to convert a bit sequence of the first length N into a bit sequence of the second length N by multiplying the bit sequence of the first length N with the polarization matrix G (N) . The polarization transformation output bit sequence d = [d0, d1, …, d N-2 , d N-1 of length N is determined by the polarization transformation input sequence u and the polarization matrix G (N) , that is, d = u·G (N) , where the vector matrix multiplication is over GF(2).
[0071] (3) Rate matching: The rate matching of polarization coding in 5G includes two operations: sub-block interleaving and bit selection.
[0072] (3.1) Sub-block interleaving: The interleaved output bit sequence d = [d'0, d'1, …, d' N-2 , d' N-1 of length N is determined by the sub-block interleaver pattern π of length 32, the polarization transformation output bit sequence d, and the polarization matrix size N, as follows:
[0073]
[0074] where π = [π0, π1, π2, π3, π4, π5, π6, π7, π8, π9, π 10 , π 11 , π 12 , π 13 , π 14 , π 15 , π 16 , π 17 , π 18 , π 19 , π 20 , π 21 , π 22 , π 23 , π 24 , π 25 , π 26 , π 27 , π 28 , π 29 , π 30 , π 31 = [0, 1, 2, 4, 3, 5, 6, 7, 8, 16, 9, 17, 10, 18, 11, 19, 12, 20, 13, 21, 14, 22, 15, 23, 24, 25, 26, 28, 27, 29, 30, 31], and J = [J0, J1, …, J N-2 , J N-1 is an interleaver pattern of length N, which is determined by the sub - block interleaver pattern π and the polarization matrix size N. The interleaver pattern J is a permutation of the integer sequence [0, 1, 2, …, N - 2, N - 1].
[0075] (3.2) Bit Selection: There are three types of bit selection: repetition, puncturing, and shortening. According to the interleaved output bit sequence d', the length K of the input bit sequence, the length E of the output bit sequence, and the polarization matrix size N, the output bit sequence e is determined as follows:
[0076] · Repetition: For E ≥ N, e k = d' mod(k,N) , k = 0, 1, 2, …, E - 2, E - 1.
[0077] · Puncturing: For E < N and K / E ≤ 7 / 16, e k = d' mod(k,N) , k = 0, 1, 2, …, E - 2, E - 1.
[0078] · Shortening: For E < N and K / E > 7 / 16, e k = d' k , k = 0, 1, 2, …, E - 2, E - 1.
[0079] Polarization Adjusted Convolutional (PAC) Coding
[0080] Some exemplary embodiments of PAC coding are disclosed in this section.
[0081] PAC codes are a class of pre-transformed polar codes. Specifically, PAC codes are polar codes using a convolutional transform.
[0082] A schematic diagram of PAC coding is as Figure 2B shown. It represents a set of data bit indices Q of size K, i.e., |Q| = K, where Q is a subset of the set of integers Z N ={0, 1, …, N - 2, N - 1}. Then, through the polarization matrix G (N) encoding the input bit sequence c = [c0, c1, …, c K-2 , c K-1 into the output bit sequence e = [e0, e1, …, e E-2 , e E-1 includes the following operations, where K is the length of the input bit sequence, E is the length of the output bit sequence, K < N, K < E and both K and E are positive integers.
[0083] Figure 3 A schematic diagram of the convolutional transform is disclosed, where the convolutional vector g = [g0, g1, …, g m or the convolutional polynomial g(D) = g0 + g1·D + … + g m-1 ·D m-1 + g m ·D m .
[0084] (1) Rate configuration: The rate configuration is the same as the operation of adding frozen bits in 5G polar coding. Therefore, in this application, the two terms "adding frozen bits" and "rate configuration" can be used interchangeably to refer to the same operation. The rate configuration operation combines N - K zero bits with the input bit sequence c to form a rate configuration output sequence v = [v0, v1, …, v N-2 , v N-1 of length N according to the data bit index set Q. Specifically, the rate configuration output bit sequence v is determined by the input bit sequence c, the data bit index set Q, and the polarization matrix size N, as follows.
[0085]
[0086] (2) Convolutional transform: The convolutional transform is an operation that converts a convolutional input bit sequence of length N into a convolutional output bit sequence of length N by convolving the convolutional input bit sequence with a generator bit sequence g = [g0, g1, …, g m-1 , gm ](Define the generator polynomial g(D)=g0+g1·D+…+g m-1 ·D m-1 +g m ·D m ) performs a convolution, where m is the memory length of the convolution transform, or equivalently the generator polynomial order of the generator polynomial g(D), and D is a dummy variable representing delay in a digital circuit.
[0087] Figure 3 The convolution transform with the generator polynomial g(D) is shown in FIG. Specifically, the convolution transform outputs a bit sequence u=[u0,u1,…,u N-2 ,u N-1 ] is determined by the rate configuration output bit sequence v, the generator polynomial g(D) (or equivalently the generator bit sequence g), and the polarization matrix size N as follows, where for i <k,v i-k =0.
[0088]
[0089] Polarization conversion: Polarization conversion is the same as in 5G polarization coding. The polarization conversion output bit sequence d = [d0, d1, ..., d N-2 ,d N-1 ] is based on the convolution transform output bit sequence u and polarization matrix G (N) Determined, that is, d = u·G (N) , where the vector-matrix multiplication is over GF(2).
[0090] Example Introduction
[0091] This section discloses multiple examples related to rate matching of polar coding, PAC coding or other pre-transformed polar coding with good performance.
[0092] Figure 4 shows a schematic diagram of eight example rate matching methods. The details of the examples will be explained in the following embodiments.
[0093] Example 1
[0094] This section discloses a coding method in a wireless communication system.
[0095] In one example, a digital communication method includes determining, by a first node, an output bit sequence having E bits based on an input bit sequence c having K bits, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a portion of the bit sequence before the polarization transformation.
[0096] The method further includes transmitting, by a first node, a signal including an output bit sequence to a second node.
[0097] In another example, a digital communication method includes: obtaining, by a first node, an input bit sequence c = [c0, c1, …, c K-1 ; determining, by the first node, an output bit sequence e = [e0, e1, …, e E-1 by performing at least one of the following: rate configuration, repetition, pre-transformation, polarization transformation using a polarization matrix G (N) ; and transmitting, by the first node, a signal including the output bit sequence e to a second node.
[0098] Here, K is the length of the input bit sequence; E is the length of the output bit sequence; N is the size of the polarization matrix, which is a power of 2; K and E are both positive integers, where K < N and N ≤ E.
[0099] Example 2
[0100] This section discloses a decoding method used in a wireless communication system.
[0101] In one example, a digital communication method includes receiving, by a second node, from a first node, a signal including an output bit sequence having E bits. The method further includes determining, by the first node, an input bit sequence c having K bits based on the signal, where the output bit sequence is determined by performing a polarization transformation and a repetition operation; where the output bit sequence is determined based on the output of the polarization transformation and the output of the repetition operation; where the input of the repetition operation is a part of the bit sequence before the polarization transformation.
[0102] In another example, a digital communication method includes receiving, by a second node, a signal transmitted by a first node and including an output bit sequence e = [e0, e1, …, e E-1 ; and determining, by the second node, one or more estimated bit sequences of an input bit sequence c = [c0, c1, …, c K-1 .
[0103] In one example, the output bit sequence e is determined by the first node by performing at least one of the following: rate configuration, repetition, pre-transformation, polarization transformation using a polarization matrix G (N) ; where K is the length of the input bit sequence; E is the length of the output bit sequence; N is the size of the polarization matrix, which is a power of 2; K and E are both positive integers, where K < N and N ≤ E.
[0104] Example 3
[0105] This section discloses an example involving an output bit sequence consisting of two parts.
[0106] Embodiment 3 is based on the above embodiment.
[0107] Output bit sequence e = [e0, e1, ..., e E-1 ] includes a first partial bit sequence d'=[d'0, d'1, d'2, ..., d' N-1 ] and the second partial bit sequence c'=[c'0,c'1,c'2,…,c' N-E-1 ].
[0108] In some embodiments, the output bit sequence e=[e0, e1, ..., e E-1 ] is the first partial bit sequence d'=[d'0,d'1,d'2,…,d' N-1 ] and the second partial bit sequence c'=[c'0,c'1,c'2,…,c' N-E-1 ], as follows:
[0109]
[0110] In some embodiments, the output bit sequence e=[e0, e1, ..., e E-1 ] is the first partial bit sequence d'=[d'0,d'1,d'2,…,d' N-1 ] and the second partial bit sequence c'=[c'0,c'1,c'2,…,c' N-E-1 ], as follows:
[0111]
[0112] 4A to 4H Eight specific examples are given of an output bit sequence e which is a concatenation of a first partial bit sequence d' and a second partial bit sequence c'.
[0113] Example 4
[0114] This section discloses examples involving a first partial bit sequence being an interleaved output.
[0115] Embodiment 4 is based on the above embodiment.
[0116] In some embodiments, the first partial bit sequence d'=[d'0, d'1, d'2, ..., d' N-1 ] is the interleaved output bit sequence, where Figure 4B , Figure 4D , Figure 4F and Figure 4HA specific example is given in the interleaving process; the interleaving process comprises obtaining an interleaved input bit sequence d=[d0, d1, ..., d N-1 ]; and the first node determines a first partial bit sequence d'=[d'0, d'1, ..., d' N-1 ]; where N is the polarization matrix size.
[0117] Interleaving is done by an interleaver pattern J=[J0,J1,…,J N-2 ,J N-1 ] Determine the first partial bit sequence d'=[d'0, d'1, ..., d' N-1 ]for i=0,1,2,…,N-2,N-1, that is, the i-th bit of the first partial bit sequence d' is equal to the interleaved input bit sequence d=[d0,d1,…,d N-1 ], where the interleaver pattern J can be any permutation of the integer sequence [0,1,2,…,N-2,N-1].
[0118] Interleaver pattern J = [J0, J1, ..., J N-2 ,J N-1 The first specific example of ] consists of a polarization matrix size N and a sub-block interleaver pattern π = [π0,π1,π2,π3,π4,π5,π6,π7,π8,π9,π 10 ,π 11 ,π 12 ,π 13 ,π 14 ,π 15 ,π 16 ,π 17 ,π 18 ,π 19 ,π 20 ,π 21 ,π 22 ,π 23 ,π 24 ,π 25 ,π 26 ,π 27 ,π 28 ,π 29 ,π 30 ,π 31 ]=[0,1,2,4,3,5,6,7,8,16,9,17,10,18,11,19,12,20,13,21,14,22,15,23,24,25,26,28,27,29,30,31] is determined as follows.
[0119]
[0120] Interleaver pattern J = [J0, J1, ..., J N-2 ,J N-1 A second specific example of ] is that index i is associated with the i-th element J in interleaver pattern J. i The relationship between satisfies the following quadratic form:
[0121] J i =mod(f1·i+f2·i 2 ,N),
[0122] Table 1 summarizes some examples of parameters f1 and f2 depending on the polarization matrix size N.
[0123]
[0124]
[0125] Table 1 Interleaver parameters
[0126] With N = 8 interleaver pattern J = [J0, J1, ..., J N-2 ,J N-1 A third specific example of ] is J=[J0,J1,J2,J3,J4,J5,J6,J7]=[5,4,7,1,6,0,2,3].
[0127] Example 5
[0128] This section discloses examples involving interleaving an input bit sequence that is a polarization transformed output bit sequence.
[0129] Example 5 is based on the above example.
[0130] In some embodiments, the interleaved input bit sequence d=[d0, d1, ..., d N-1 ] is the polarization transformation output bit sequence of length N, which is obtained by using the polarization matrix G (N) The polarization transformation of is determined by Figure 4B , Figure 4D , Figure 4F and Figure 4H A specific example is given in .
[0131] Example 6
[0132] This section discloses an example involving the first partial bit sequence being a polarization transformed output bit sequence.
[0133] Example 6 is based on the above example.
[0134] In some embodiments, the first partial bit sequence d'=[d'0, d'1, d'2, ..., d' N-1] is equal to the polarization conversion output bit sequence d=[d0,d1,d2,…,d N-1 ], which is done by using the polarization matrix G (N) Polarization transformation is performed to determine, where for i = 0, 1, 2, ..., N-1, d' i =d i , where specific examples include Figure 4A , Figure 4C , Figure 4E and Figure 4G shown.
[0135] Example 7
[0136] This section discloses examples involving polarization transformations.
[0137] Example 7 is based on the above example.
[0138] Determine the polarization conversion output bit sequence d = [d0, d1, d2, ..., d N-1 ] includes obtaining a polarization transformation input bit sequence u=[u0,u1,…,u N-1 ]; and the polarization conversion output bit sequence d = [d0, d1, ..., d N-1 ].
[0139] Here, the polarization conversion input bit sequence u=[u0,u1,…,u N-1 The length of ] is equal to the polarization matrix size N. The polarization conversion output bit sequence d is determined by the first node by multiplying the polarization conversion input bit sequence u with the polarization matrix G(N) of N rows and N columns, that is, d = u·G (N) , where the vector-matrix multiplication is performed over GF(2).
[0140] Example 8
[0141] This section discloses examples involving polarization transformed input bit sequences being pre-transformed output bit sequences.
[0142] Example 8 is based on the above example.
[0143] In some embodiments, the polarization conversion input bit sequence u=[u0,u1,…,u N-1 ] is the pre-transformed output bit sequence of the pre-transformation, where Figure 4C , Figure 4D , Figure 4G and Figure 4H A specific example is given in .
[0144] The pre-transformation includes obtaining a pre-transformation input bit sequence v=[v0, v1, ..., v N-1]; and the first node determines the pre-transformed output bit sequence u=[u0,u1,…,u N-1 ]; where N is the polarization matrix size.
[0145] Used to determine the parameters of the pre-transformation
[0146] The pre-transformation is performed by the first node to determine a pre-transformed output bit sequence u corresponding to the pre-transformed input bit sequence v using at least one of the following:
[0147] Generator bit sequence g = [g0, g1, ..., g m ],
[0148] Generator polynomial g(D)=g0+g1·D+…+g on GF(2) m-1 ·D m-1 +g m ·D m ,
[0149] The recursive feedback bit sequence q=[q0,q1,…,q m ],
[0150] · Recursive feedback polynomial q(D)=q0+q1·D+…+q on GF(2) m ·D m ,
[0151] The state bit sequence t = [t0, t1, ..., t m-1 ,t m ],
[0152] Here, m is called the memory length.
[0153] Pre-transformation using the generator polynomial g(D) or the generator bit sequence g
[0154] In some embodiments, the pre-transformation is based on a generator polynomial g(D)=g0+g1·D+g2·D+…+g m-1 ·D+g m D (or equivalently the generator bit sequence g = [g0, g1, g2, ..., g m-1 ,g m ]) determine the pre-transformed output bit sequence u corresponding to the pre-transformed input bit sequence v, where m is called the memory length of the generator polynomial g(D) (or generator bit sequence g).
[0155] Generator polynomial g(D) = g0+g1·D+…+g m-1 ·D m-1 +g m ·D mcan be any binary polynomial over GF(2), where m is the polynomial order or memory length.
[0156] In a specific example with a memory length of m=6, the generator polynomial is g(D)=g0+g1·D+g2·D 2 +g3·D 3 +g4·D 4 +g5·D 5 +g6·D 6 =1+0·D+1·D 2+ 1.D 3 +0·D 4 +1·D 5 +1·D 6 =1+D 2 +D 3 +D 5 +D 6 .
[0157] In another specific example with a memory length of m=3, the generator polynomial is g(D)=g0+g1·D+g2·D 2 +g3·D 3 =1+1·D+0·D 2 +1·D 3 =1+D+D 3 . Generator bit sequence g = [g0, g1, ..., g m ] can be any binary sequence of length m+1, where m is called the memory length. In the specific example of memory length m=6, the generator bit sequence is g=[g0,g1,g2,g3,g4,g5,g6]=[1,0,1,1,0,1,1]. In another specific example of memory length m=3, the generator bit sequence is g=[g0,g1,g2,g3]=[1,1,0,1].
[0158] Generator polynomial g(D) = g0+g1·D+…+g m ·D m A more specific example is as follows:
[0159] (1) For m = 1, g(D) = g0 + g1·D + ... + g m ·D m =g0+g1·D=1+D;
[0160] (2) For m = 2, g(D) = g0 + g1·D + ... + g m ·D m =g0+g1·D+g2·D 2 =1+D 2 ;
[0161] (3) For m = 3, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + g3·D 3 = 1 + D + D 2 + D 3 ;
[0162] (4) For m = 4, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + g3·D 3 + g4·D 4 = 1 + D + D 2 + D 4 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + g3·D 3 + g4·D 4 = 1 + D 2 + D 3 + D 4 ;
[0163] (5) For m = 5, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g5·D 5 = 1 + D + D 3 + D 5 And g(D) = g0 + g1·D + … + g m ·D m = g 0+ g1·D + g2·D 2 + … + g5·D 5 = 1 + D 2 + D 4 + D 5 ;
[0164] (6) For m = 6, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g6·D 6 = 1 + D 6 ;
[0165] (7) For m = 7,
[0166] g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g7·D 7 =1 + D 3 +D 5 +D 7 And
[0167] g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g7·D 7 =1 + D 2 +D 4 +D 7 ;
[0168] (8) For m = 8, g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g8·D 8 =1 + D 4 +D 8 ;
[0169] (9) For m = 9,
[0170] g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g9·D 9 =1 + D 3 +D 4 +D 5 +D 7 +D 9 And g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g9·D 9 =1 + D 2 +D 4 +D 5 +D 6 +D 9 ;
[0171] (10) For m = 10, g(D)=g0 + g1·D + … + g m ·D m =g0 + g1·D + g2·D 2 +… + g 10 ·D 10= 1 + D 2 + D 6 + D 7 + D 10 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 10 ·D 10 = 1 + D 3 + D 4 + D 8 + D 10 ;
[0172] (11) For m = 11, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 11 ·D 11 = 1 + D + D 2 + D 4 + D 8 + D 10 + D 11 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 11 ·D 11 = 1 + D + D 3 + D 7 + D 9 + D 10 + D 11 ;
[0173] (12) For m = 12, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 12 ·D 12 = 1 + D 2 + D 5 + D 6 + D 7 + D 8 + D 9 + D 10 + D 11 + D 12 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 12 ·D12 = 1 + D + D 2 + D 3 + D 4 + D 5 + D 6 + D 7 + D 10 + D 12 ;
[0174] (13) For m = 13, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 13 ·D 13 = 1 + D + D 4 + D 5 + D 9 + D 10 + D 13 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 13 ·D 13 = 1 + D 3 + D 4 + D 8 + D 9 + D 12 + D 13 ;
[0175] (14) For m = 14, g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 14 ·D 14 = 1 + D + D 2 + D 7 + D 8 + D 10 + D 12 + D 14 And g(D) = g0 + g1·D + … + g m ·D m = g0 + g1·D + g2·D 2 + … + g 14 ·D 14 = 1 + D 2 + D 4 + D 6 + D 7 + D 12 + D 13 + D 14 ;
[0176] (15) For m = 15, g(D) = g0 + g1·D + ... + g m ·D m =g0+g1·D+g2·D 2 +…+g 15 ·D 15 =1+D+D 4 +D 6 +D 7 +D 8 +D 9 +D 15 And g(D)=g0+g1·D+…+g m ·D m =g0+g1·D+g2·D 2 +…+g 15 ·D 15 =1+D 6 +D 7 +D 8 +D 9 +D 11 +D 14 +D 15 ;
[0177] (16) For m = 16, g(D) = g0 + g1·D + ... + g m ·D m =g0+g1·D+g2·D 2 +…+g 16 ·D 16 =1+D 2 +D 4 +D 6 +D 8 +D 13 +D 14 +D 16 And g(D)=g0+g1·D+…+g m ·D m =g0+g1·D+g2·D 2 +…+g 16 ·D 16 =1+D 2 +D 3 +D 8 +D 10 +D 12 +D 14 +D 16 ;
[0178] Where m is the memory length.
[0179] Figure 3Shows a specific schematic diagram of the pre - transformation using a generator polynomial g(D)=g0 + g1·D+…+g m-1 ·D m-1 +g m ·D m (or the generator bit sequence g = [g0,g1,…,g m ), where the bit u i with index i in the pre - transformation output bit sequence u is determined by m + 1 bits v i , v i-1 , v i-2 ,…, v i-m , where the consecutive indices in the pre - transformation input bit sequence v are i, i - 1, i - 2,…, i - m, and the generator polynomial g(D)=g0 + g1·D+…+g m-1 ·D m-1 +g m ·D m (or the generator bit sequence g = [g0,g1,…,g m ) is as follows:
[0180]
[0181] Here, the summation and multiplication are both over GF(2); for i < k, the bit v i-k = 0; g k is the coefficient of the term of order k in the generator polynomial g(D)=g0 + g1·D+…+g m-1 ·D m-1 +g m ·D m (or equivalent to the bit at index k in the generator bit sequence g = [g0,g1,…,g m ). The specific pseudocode is as follows.
[0182]
[0183] Pre - transformation using a recursive feedback polynomial q(D) or a recursive feedback bit sequence q
[0184] In some embodiments, the pre - transformation determines the pre - transformation output bit sequence u corresponding to the pre - transformation input bit sequence v according to a recursive feedback polynomial (or equivalent to a recursive feedback bit sequence q = [q0,q1,q2,…,q m-1 ,q m ), where m is called the memory length of the recursive feedback polynomial q(D) or (the recursive feedback bit sequence q).
[0185] The recursive feedback polynomial q(D)=q0 + q1·D+…+q m-1 ·Dm-1 +q m ·D m is a binary polynomial with the zeroth-order coefficient q0 being 1 and the other coefficients q1, …, q m is any binary value over GF(2), where m is the memory length. In the specific example of memory length m=6, the recursive feedback polynomial is q(D)=q0+q1·D+q2·D 2 +q3·D 3 +q4·D 4 +q5·D 5 +q6·D 6 =1+0·D+1·D 2 +0·D 3 +1·D 4 +1·D 5 +1·D 6 =1+D 2 +D 4 +D 5 +D 6 In another specific example where the memory length is m=3, the recursive feedback polynomial is q(D)=q0+q1·D+q2·D 2 +q3·D 3 =1+0·D+1·D 2 +1·D 3 =1+D 2 +D 3 . Recursive feedback bit sequence q=[q0,q1,…,q m ] is a binary sequence of length m+1, where [q1,…,q m ] can be any binary sequence of length m and q0=1, where m is the memory length. In a specific example of memory length m=3, the recursive feedback bit sequence is q=[q0,q1,q2,q3,q4,q5,q6]=[1,0,1,0,1,1,1]. In another specific example of memory length m=3, the recursive feedback bit sequence is q=[q0,q1,q2,q3]=[1,0,1,1].
[0186] Figure 5 It shows that the recursive feedback polynomial q(D) = q0 + q1·D + ... + q m-1 ·D m-1 +q m ·D m (or equivalently, the recursive feedback bit sequence q = [q0, q1, q2, ..., q m-1 ,q m ]) wherein q0=1 and the memory length is m, wherein the pre-transformation output bit sequence u has a bit u with index i i Determined by:
[0187] In the pre-transformed input bit sequence v = [v0, v1, …, v N-1 with index i, the bit v i ,
[0188] In the pre-transformed output bit sequence u, the first m bits u i-1 , u i-2 , …, u i-m , and
[0189] The recursive feedback polynomial q(D) = q0 + q1·D + … + q m-1 ·D m-1 + q m ·D m (or the recursive feedback bit sequence q = [q0, q1, …, q m ), where q0 = 1.
[0190] Here, a specific example is where the summation and multiplication are both over GF(2); for i < k, the bit u i-k = 0; q k is the coefficient of the term of order k in the recursive feedback polynomial q(D) = q0 + q1·D + … + q m-1 ·D m-1 + q m ·D m (or equivalently the bit at index k in the recursive feedback bit sequence q = [q0, q1, …, q m ). The specific pseudocode is as follows.
[0191]
[0192] The pre-transformation using both the generator polynomial g(D) and the recursive feedback polynomial q(D) (or both the generator bit sequence g and the recursive feedback bit sequence q)
[0193] In some embodiments, the pre-transformation is based on the generator polynomial g(D) = g0 + g1·D + g2·D + … + g m-1 ·D + g m ·D and the recursive feedback polynomial q(D) = q0 + q1·D + … + q m-1 ·D m-1 + q m ·D m (or equivalently the generator bit sequence g = [g0, g1, g2, …, g m-1 , g m and the recursive feedback bit sequence q = [q0, q1, q2, …, q m-1 , qm ] both) determine the pre-transformed output bit sequence u corresponding to the pre-transformed input bit sequence v, where m is called the memory length of the generator polynomial g(D) and the recursive feedback polynomial q(D) (or equivalently the generator bit sequence g and the recursive feedback bit sequence q).
[0194] Generator polynomial g(D) = g0+g1·D+…+g m-1 ·D m-1 +g m ·D m can be any binary polynomial over GF(2), where m is the polynomial order or memory length. In a specific example with a memory length of m = 6, the generator polynomial is g(D) = g0 + g1·D + g2·D 2 +g3·D 3 +g4·D 4 +g5·D 5 +g6·D 6 =1+0·D+1·D 2+ 1.D 3 +0·D 4 +1·D 5 +1·D 6 =1+D 2 +D 3 +D 5 +D 6 In another specific example with a memory length of m=3, the generator polynomial is g(D)=g0+g1·D+g2·D 2 +g3·D 3 =1+1·D+0·D 2 +1·D 3 =1+D+D 3 .
[0195] Generator bit sequence g = [g0, g1, ..., g m ] can be any binary sequence of length m+1, where m is called the memory length. In the specific example of memory length m=6, the generator bit sequence is g=[g0,g1,g2,g3,g4,g5,g6]=[1,0,1,1,0,1,1]. In another specific example of memory length m=3, the generator bit sequence is g=[g0,g1,g2,g3]=[1,1,0,1].
[0196] Recursive feedback polynomial q(D) = q0 + q1·D + ... + q m-1 ·D m-1 +q m ·D m is a binary polynomial with the zero-order coefficient q0 being 1 and the other coefficients q1,…,q mis any binary value over GF(2), where m is the memory length. In the specific example of memory length m=6, the recursive feedback polynomial is q(D)=q0+q1·D+q2·D 2 +q3·D 3 +q4·D 4 +q5·D 5 +q6·D 6 =1+0·D+1·D 2 +0·D 3 +1·D 4 +1·D 5 +1·D 6 =1+D 2 +D 4 +D 5 +D 6 .
[0197] In another specific example where the memory length is m=3, the recursive feedback polynomial is q(D)=q0+q1·D+q2·D 2 +q3·D 3 =1+0·D+1·D 2 +1·D 3 =1+D 2 +D 3 Feedback bit sequence q=[q0,q1,…,q m ] is a binary sequence of length m+1, where [q1,…,q m ] can be any binary sequence of length m and q0=1, where m is the memory length.
[0198] In a specific example of memory length m=3, the feedback bit sequence is q=[q0,q1,q2,q3,q4,q5,q6]=[1,0,1,0,1,1,1]. In another specific example of memory length m=3, the feedback bit sequence is q=[q0,q1,q2,q3]=[1,0,1,1].
[0199] Figure 6 It shows that the generator polynomial g(D) = g0 + g1·D + ... + g m-1 ·D m-1 +g m ·D m Schematic diagram of a pre-transformation of both a generator bit sequence g and a recursive feedback polynomial q(D) (or equivalently both a generator bit sequence g and a recursive feedback bit sequence q), wherein the pre-transformation determines a bit u with index i in the pre-transformed output bit sequence u i ,include:
[0200] The first node sets the state bit sequence t = [t0, t1, t2, ..., t m] with index 0 is set to the pre-transformed input bit sequence v = [v0, v1, v2, ..., v N-1 ] with bit v having index i i , that is, t0 = v i ;as well as
[0201] From the first node, through the recursive feedback polynomial q(D)=q0+q1·D+…+q on GF(2) m ·D m (or equivalently, the feedback bit sequence q=[q0,q1,…,q m ]) and the updated state bit sequence t=[t0,t1,t2…,t m-1 ,t m ] Determine the summation bit s as as well as
[0202] The first node sets the state bit sequence t = [t0, t1, t2…, t m-1 ,t m ] with index 0 is set to the sum bit s, i.e., t0=s, and
[0203] The generator polynomial g(D)=g0+g1·D+…+g m ·D m (or equivalently the generator bit sequence g = [g0, g1, ..., g m ]) and the updated state bit sequence t=[t0,t1,…,t m-1 ,t m ] Determine the pre-transformation output bit sequence u=[u0,u1,u2,…,u N-1 ] with index i in bit u i for
[0204]
[0205] The first node sets the state bit sequence t=[t0, t1,…, t m-1 ,t m ] performs a right shift, where the state bit sequence t = [t0, t1, ..., t m-1 ,t m ], bit t0 with index 0 is set to 0 as shown below.
[0206]
[0207] The specific pseudo code of the above steps is as follows.
[0208]
[0209] Example 9
[0210] This section discloses examples involving a pre-transformed input bit sequence being a rate-configured output bit sequence.
[0211] Embodiment 9 is based on the above-mentioned related embodiments.
[0212] In some embodiments, the pre-transformed input bit sequence v = [v0, v1, ..., v N-1 ] is the rate configuration output bit sequence of length N determined by the rate configuration, where Figure 4C , Figure 4D , Figure 4G and Figure 4H A specific example is given in .
[0213] Example 10
[0214] This section discloses examples involving polarization transformed input bit sequences being rate configured output bit sequences.
[0215] Embodiment 10 is based on the above-mentioned related embodiments.
[0216] In some embodiments, the polarization conversion input bit sequence u=[u0,u1,…,u N-1 ] is equal to the rate configuration output bit sequence v = [v0, v1, ..., v N-1 ], where u = v, N is the polarization matrix size, and a specific example is as follows Figure 4A , Figure 4B , Figure 4E and Figure 4F shown.
[0217] Embodiment 11
[0218] This section discloses examples involving rate configuration blocks.
[0219] Example 11 is based on the above example.
[0220] The rate configuration determines the rate configuration output bit sequence v = [v0, v1, ..., v N-1 ] includes: obtaining a rate configuration input bit sequence by the first node; and determining a rate configuration output bit sequence v=[v0, v1, ..., v N-1 ]; where K is the length of the input bit sequence; the rate configuration input bit sequence is an input bit sequence of length K c = [c0, c1, ..., c K-1 ]; 4A to 4H A specific example is given in .
[0221] Description of the data index set Q
[0222] In some embodiments, the data index set Q is a first integer set Z N = a subset of {0, 1, 2, ..., N-2, N-1}, where the first integer set Z N = {0, 1, 2, ..., N-2, N-1} includes and only includes all non-negative integers less than N. Data index set Q = {Q0, Q1, ..., Q K-2 ,Q K-1} has K non-negative elements Q0, Q1, ..., Q K-2 , Q K-1 , that is, the size of the data index set Q is K.
[0223] In some embodiments, for k=0, 1, ..., K-2, the element Q in the data index set Q k Less than Q k+1 , that is, the data index set is based on the index value according to Q0 <Q1<…<Q K-2 K-1 In some embodiments, for k=0, 1, ..., K-2, the element Q in the data index set Q is k Greater than Q k+1 , that is, the data index set is based on the index value in the order of Q0>Q1>…>Q K-2 >Q K-1 Sort in descending order.
[0224] In some embodiments, for k=0, 1, ..., K-2, the Qth k polarization subchannel (denoted as W(Q k )) is less reliable than Q k+1 polarization subchannel (denoted as W(Q k+1 )), that is, the data index set is calculated according to the reliability of the polarization channel according to W(Q0) <W(Q1)<…<W(Q K-2 ) <W(Q K-1 ) in ascending order. In some embodiments, for k=0, 1, ..., K-2, the Qth k polarization subchannel (denoted as W(Q k )) is more reliable than Q k+1 polarization subchannel (denoted as W(Q k+1 )), that is, the data index set is W(Q0)>W(Q1)>…>W(Q K-2 )>W(Q K-1 ) in descending order.
[0225] In a first specific example where N=8 and K=4, the data index set is Q={Q0, Q1, Q2, Q3}={3, 5, 6, 7}. In a second specific example where N=8 and K=4, the data index set is Q={Q0, Q1, Q2, Q3}={7, 6, 5, 3}.
[0226] In the third specific example where N=32 and K=25, the data index set Q={Q0, Q1, Q2, Q3, Q4, Q5, Q6, Q7, Q8, Q9, Q 10 ,Q 11 ,Q 12 ,Q 13 ,Q 14 ,Q 15 ,Q 16 ,Q 17 ,Q 18 ,Q 19 ,Q 20 ,Q 21 ,Q 22 ,Q 23 ,Q 24} = {5,9,6,17,10,18,12,20,24,7,11,19,13,14,21,26,25,22,28,15,23,31,27,29,30}, where the polarimetric channel reliability is calculated according to W(Q0) <W(Q1)<W(Q2)<W(Q3)<W(Q4)<W(Q5)<W(Q6)<W(Q7)<W(Q8)<W(Q9)<W(Q 10 ) <W(Q 11 ) <W(Q 12 ) <W(Q 13 ) <W(Q 14 ) <W(Q 15 ) <W(Q 16 ) <W(Q 17 ) <W(Q 18 ) <W(Q 19 ) <W(Q 20 ) <W(Q 21 ) <W(Q 22 ) <W(Q 23 ) <W(Q 24 ). In the fourth specific example where N=32 and K=6, the data index set is Q={Q0,Q1,Q2,Q3,Q4,Q5}={30,29,27,31,23,15}, where the polarization subchannels follow the order of W(Q0)>W(Q1)>W(Q2)>W(Q3)>W(Q4)>W(Q5).
[0227] In some embodiments, the rate configuration is determined based on the data index set Q and the rate configuration input bit sequence c=[c0, c1, .., c K-1 ] The corresponding rate configuration output bit sequence v = [v0, v1, ..., v N-1 ] as shown below.
[0228]
[0229] The specific example pseudo code for rate configuration is as follows.
[0230]
[0231] In some embodiments, the rate configuration output bit sequence v is a multiplex of the rate configuration input bit sequence c and the rate configuration frozen bit sequence f, where the length of the rate configuration frozen bit sequence f is NK; N is the polarization matrix size, and K is the rate configuration input bit sequence length.
[0232] A first specific example where N=8 and K=3 is a rate configuration input bit sequence c=[c0,c1,c2] and a rate configuration frozen bit sequence f=[f0,f1,f2,f3,f4], then the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7]=[f0,f1,f2,f3,f4,c0,c1,c2].
[0233] A second specific example where N=16 and K=4 is a rate configuration input bit sequence c=[c0, c1, c2, c3] and a rate configuration frozen bit sequence f=[f0, f1, f2, f3, f4, f5, f6, f7, f8, f9, f 10 ,f 11 ], then the rate configuration output bit sequence v = [v0,v1,v2,v3,v4,v5,v6,v7,v8,v9,v 10 ,v 11 ,v 12 ,v 13 ,v 14 ,v 15 ]=[f0,f1,f2,f3,f4,f5,f6,f7,f8,f9,f 10 ,c0,f 11 ,c1,c2,c3].
[0234] Algorithm 1A in Table 2 gives a third specific example.
[0235] In some embodiments, for index i belonging to data index set Q, bit v in rate configuration output bit sequence v i are the bits in the rate configuration input bit sequence c.
[0236] In the first specific example where N=8, K=3 and data index set Q={5,6,7}, the rate configuration input bit sequence c=[c0,c1,c2], the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7] having bits v5, v6, v7 whose indices belong to the data index set Q={5,6,7} is set to v5=c0, v6=c1, and v7=c2.
[0237] In the second specific example where N=16, K=4 and the data index set Q={11,13,14,15}, the rate configuration input bit sequence c=[c0,c1,c2,c3], the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7,v8,v9,v 10 ,v 11 ,v 12 ,v 13 ,v 14 ,v 15 ] has a bit v with an index belonging to the data index set Q = {11,13,14,15} 11 , v 13 , v 14 , v 15 is set to v 11 =c0,v 12 =c1,v 13 = c2, and v 14 =c3.
[0238] Algorithm 1A in Table 2 gives a third specific example.
[0239] Algorithm 1B in Table 2 gives a fourth specific example.
[0240] In some embodiments, for an index i that does not belong to the data index set Q, bit v in the rate configuration output bit sequence v i are bits in the rate configuration frozen bit sequence f. In a first specific example where N=8, K=3 and Q={5,6,7}, the rate configuration frozen bit sequence f=[f0,f1,f2,f3,f4], bits v0, v1, v2, v3, v4 in the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7] with indices that do not belong to the data index set Q={5,6,7} are set to v0=f0, v1=f1, v2=f2, v3=f3, and v4=f4.
[0241] In the second specific example where N=16, K=4 and Q={11,13,14,15}, the rate configuration frozen bit sequence f=[f0,f1,f2,f3,f4,f5,f6,f7,f8,f9,f 10 ,f 11 ], rate configuration output bit sequence v = [v0,v1,v2,v3,v4,v5,v6,v7,v8,v9,v 10 ,v 11 ,v 12 ,v 13 ,v 14 ,v 15 ] has bits v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v 10 , v 12 is set to v0=f0, v1=f1, v2=f2, v3=f3, v4=f4, v5=f5, v6=f6, v7=f7, v8=f8, v9=f9, v 10 =f 10 , and v 12 =f 11 .
[0242] Algorithm 1A in Table 2 gives a third specific example.
[0243] In some embodiments, the rate configuration output bit sequence v is a multiplex of the rate configuration input bit sequence c and an all-zero sequence of length NK, where N is the polarization matrix size and K is the rate configuration input bit sequence length.
[0244] A first specific example where N=8 and K=3 is a rate configuration input bit sequence c=[c0,c1,c2] and an all-zero sequence of length NK=8-3=5, then a rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7]=[0,0,0,0,0,c0,c1,c2].
[0245] A second specific example where N=16 and K=4 is a rate configuration input bit sequence c=[c0,c1,c2,c3] and an all-zero sequence of length NK=16-4=12, then the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7,v8,v9,v 10 ,v 11 ,v 12 ,v 13 ,v 14 ,v 15]=[0,0,0,0,0,0,0,0,0,0,c0,0,c1,c2,c3].
[0246] Algorithm 1B in Table 2 gives a third specific example.
[0247] In some embodiments, for an index i that does not belong to the data index set Q, bit v in the rate configuration output bit sequence v i is equal to 0.
[0248] In a first specific example where N=8, K=3 and Q={5,6,7}, bits v0, v1, v2, v3, v4 having indices that do not belong to the data index set Q={5,6,7} in the rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7] are set to v0=0, v1=0, v2=0, v3=0, and v4=0.
[0249] In the second specific example where N=16, K=4 and Q={11,13,14,15}, the rate configuration outputs the bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7,v8,v9,v 10 ,v 11 ,v 12 ,v 13 ,v 14 ,v 15 ] has bits v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16, v17, v18, v19, v20, v21, v22, v23, v24, v25, v26, v27, v28, v29, v30, v31, v32, v 10 , v 12 is set to v0=0, v1=0, v2=0, v3=0, v4=0, v5=0, v6=0, v7=0, v8=0, v9=0, v 10 = 0, and v 12 =0.
[0250] Algorithm 1B in Table 2 gives a third specific example.
[0251]
[0252] Table 2 Algorithm 1A and Algorithm 1B
[0253] Example 12
[0254] This section discloses examples involving a repetition in which the second partial bit sequence is a portion of the input bit sequence.
[0255] Example 12 is based on the above example.
[0256] The second partial bit sequence c'=[c'0,c'1,c'2,…,c' E-N-1 ] is the input bit sequence c = [c0, c1, c2, ..., c K-1 ], wherein the second partial bit sequence c'=[c'0, c'1, c'2, ..., c' N-E-1 ] is obtained by taking the input bit sequence c = [c0, c1, c2, ..., c K-1 ] is determined as a repetition of the input; where Figure 4E , Figure 4F , Figure 4G and Figure 4H A specific example is given in .
[0257] Repeating a part of the input bit sequence c
[0258] In some embodiments, the repeating includes obtaining, by the first node, a portion of the input bit sequence c of length Nb; and determining, by the first node, a second partial bit sequence c' based on the portion of the input bit sequence c of length Nb as follows:
[0259] c′ r =c mod(r,Nb) ,r=0,1,2,…,EN-1.
[0260] Here, Nb can be any positive integer not greater than K; Nb is the length of the portion of the input bit sequence c; the portion of the input bit sequence c is [c0, c1, c2, …, c Nb-1 ], i.e., the first Nb bits in the input bit sequence c.
[0261] In some embodiments, the length Nb of the portion of the input bit sequence c is determined by the input sequence length K and a repetition ratio p, where the repetition ratio p is a positive real number not greater than 1.
[0262] The first specific example with example number 1 in Table 3 is that the length of the portion of the input bit sequence c is Nb=K·ρ.
[0263] The second specific example with example number 2 in Table 3 is that the length of the portion of the input bit sequence c is Nb=floor(K·ρ).
[0264] The third specific example whose example number is 3 in Table 3 is that the length of the portion of the input bit sequence c is Nb=ceil(K·ρ).
[0265] The fourth specific example whose example number is 4 in Table 3 is that the length of the portion of the input bit sequence c is Nb=round(K·ρ).
[0266] The fifth specific example with example number 5 in Table 3 is that the length of the portion of the input bit sequence c is Nb=K.
[0267]
[0268]
[0269] Table 3 Specific examples of length Nb and part of input bit sequence c
[0270] Repeat according to the binary representation of the output bit sequence length E
[0271] In some embodiments, the repeating includes obtaining, by the first node, an input bit sequence c=[c0, c1, c2, . . . , c K-1 ]; n+1 bits are determined by the first node is the binary representation of the output bit sequence length E, that is Where N = 2 n ; and determining a second partial bit sequence c' by the first node, so that the second partial bit sequence c' is n repeated subsequences c' (n-1) ,c' (n-2) ,…,c' (1) ,c' (0) cascade, that is, c'=[c' (n-1 ),c' (n-2) ,…,c' (1) ,c' (0) ] or c'=[c' (0 ),c' (1) ,…,c' (n-2) ,c' (n-1) ].
[0272] Here, N is the size of the polarization matrix; for i = 0, 1, ..., n-1, the i-th repeated subsequence c' (i) The length is Among them, if Then the i-th repeated subsequence is a gap sequence; if Then the i-th repeated subsequence c' (i) The first node determines the i-th repetitive subsequence c' based on a portion of the input bit sequence c of length Nb. (i) To obtain, as follows:
[0273]
[0274] Where Nb can be any positive integer not greater than K; Nb is the length of the portion of the input bit sequence c; the portion of the input bit sequence c is [c0, c1, c2, …, c Nb-1 ], i.e., the first Nb bits in the input bit sequence c.
[0275] In the first specific example where parameters K=7, N=32, E=44, Nb=K=7, the input bit sequence c=[c0, c1, c2, c3, c4, c5, c6, c7], the second partial bit sequence c' is determined as follows.
[0276] (1) Determine n = log2(N) = 5, and the output bit sequence length E = 44 with n + 1 = 6 bits is represented by binary
[0277]
[0278] (2) Determine n=5 repeated subsequences c' (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) The lengths are as follows:
[0279]
[0280]
[0281] (3) Determine n=5 repeated subsequences c' (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) as follows:
[0282] c' (4) =[],
[0283]
[0284] c' (1) =[],
[0285] c' (0) =[];
[0286] (4) Repeat the subsequence c' with n=5 (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) Concatenated into the second partial bit sequence c', i.e., a length of EN = 44 - 32 = 12
[0287] In the second specific example where parameters K=7, N=32, E=44, Nb=5, the input bit sequence c=[c0, c1, c2, c3, c4, c5, c6, c7], the second partial bit sequence c' is determined as follows.
[0288] (1) Determine n = log2(N) = 5, and the output bit sequence length E = 44 with n + 1 = 6 bits is represented by binary
[0289]
[0290] (2) Determine n=5 repeated subsequences c' (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) The lengths are as follows:
[0291]
[0292] (3) Determine n=5 repeated subsequences c' (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) for:
[0293] c' (4) =[],
[0294]
[0295] c' (1) =[],
[0296] c' (0) =[];
[0297] (4) Repeat the subsequence c' with n=5 (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) Concatenated into the second partial bit sequence c', i.e., a length of EN = 44 - 32 = 12
[0298] Repetition according to a repetition index sequence R with elements less than K
[0299] In some embodiments, the repetition includes obtaining, by the first node, a portion of the input bit sequence c; and repetition by the first node according to a repetition index sequence R=[R0, R1, . . . , R Nr-2 ,R Nr-1 ] Determine the second partial bit sequence c' as:
[0300]
[0301] Here, Nr=EN is the length of the repetition index sequence; for r=0, 1, 2, ..., Nr-1, Rr is a non - negative integer less than K, i.e., 0 ≤ R r < K; where K is the length of the input bit sequence; N is the size of the polarization matrix; E is the length of the output bit sequence.
[0302] For the first specific example where the length of the input bit sequence K = 4, the size of the polarization matrix N = 8, and the length of the output bit sequence E = 11, the length of the repeated index sequence Nr = E - N = 11 - 8 = 3, and the repeated index sequence R = [R0, R1, …, R Nr-2 , R Nr-1 = [R0, R1, R2] = [3, 0, 1], and the second - part bit sequence c’ = [c’0, c’1, …, c’ N-E-1 = [c’0, c’1, c’2] = [c3, c0, c1].
[0303] For the second specific example where the length of the input bit sequence K = 4, the size of the polarization matrix N = 8, and the length of the output bit sequence E = 11, the length of the repeated index sequence Nr = E - N = 11 - 8 = 3, and the repeated index order R = [R0, R1, …, R Nr-2 , R Nr-1 = [R0, R1, R2] = [0, 0, 1], and the second - part bit sequence c’ = [c’0, c’1, …, c’ N-E-1 = [c’0, c’1, c’2] = [c0, c0, c1].
[0304] For the third specific example where the length of the input bit sequence K = 4, the size of the polarization matrix N = 8, and the length of the output bit sequence E = 14, the length of the repeated index sequence Nr = E - N = 14 - 8 = 6, and the repeated index order R = [R0, R1, …, R Nr-2 , R Nr-1 = [R0, R1, R2, R3, R4, R5] = [0, 0, 1, 2, 2, 2], and the second - part bit sequence c’ = [c’0, c’1, …, c’ N-E-1 = [c’0, c’1, c’2, c’3, c’4, c’5] = [c0, c0, c1, c2, c2, c2].
[0305] Repeating according to the repeated index sequence R with elements less than K and the repetition number sequence T
[0306] In some embodiments, repeating includes obtaining, by a first node, a part of the input bit sequence c; and, by the first node, according to the repeated index sequence R = [R0, R1, …, R Nr-2 , R Nr-1 of length Nr and the repetition number sequence T = [T0, T1, …, T Nr-2 , T Nr-1Determine the second partial bit sequence c’ such that for r = 0, 1, 2, …, Nr, the second partial bit sequence c’ includes the R r -th bit of the portion of the input bit sequence c r T copies.
[0307] The second partial bit sequence c’ corresponding to a portion of the input bit sequence c, the repetition index sequence R = [R0, R1, …, R Nr-2 , R Nr-1 , and the repetition number sequence T = [T0, T1, …, T Nr-2 , T Nr-1 is specifically exemplified as follows:
[0308]
[0309] Here, Nr is a positive integer not greater than the length K of the input bit sequence; r = 0, 1, 2, …, Nr - 1, R r is a non - negative integer less than K, i.e., 0 ≤ R r < K; for any two indices r0 ≠ r1 but R r0 ≠ R r1 ; for r = 0, 1, 2, …, Nr, the elements T Nr-2 , T Nr-1 in the repetition number sequence T = [T0, T1, …, T r are positive integers; the sum of the elements in the repetition number sequence T = [T0, T1, …, T Nr-2 , T Nr-1 is equal to E - N, i.e., where K is the length of the input bit sequence, N is the size of the polarization matrix, and E is the length of the output bit sequence.
[0310] A first specific example where K = 4, N = 8, E = 14, the repetition index sequence R = [R0, R1, R2] = [2, 3, 1] of length Nr = 3, and the repetition number sequence T = [T0, T1, …, T Nr-1 = [2, 1, 3], where T 0+ T1 + T2 = 2 + 1 + 3 = 6 = E - N = 14 - 8, and the second partial bit sequence c’ = [c'0, c'1, …, c' E-N-1 = [c'0, c'1, c'2, c'3, c'4, c'5] = [c2, c2, c3, c1, c1, c1], corresponding to a portion of the input bit sequence c = [c0, c1, c2, c3].
[0311] In the second specific example where K=4, N=8, and E=13, the repetition index sequence R=[R0, R1, R2]=[2, 3, 1] of length Nr=3, and the repetition number sequence T=[T0, T1, ..., T Nr-1 ]=[2,1,2], where T0+T1+T2=2+1+2=5=EN=13-8, the second partial bit sequence c'=[c'0,c'1,…,c' E-N-1 ]=[c'0,c'1,c'2,c'3,c'4]=[c2,c2,c3,c1,c1], corresponding to the input bit sequence c=[c0,c1,…,c K-1 ]=part of [c0,c1,c2,c3].
[0312] Example 13
[0313] This section discloses examples involving repetitions in which the second partial bit sequence is a portion of a rate-configured output bit sequence.
[0314] Example 13 is based on the above-mentioned related embodiments.
[0315] The second partial bit sequence c'=[c'0,c'1,c'2,…,c' E-N-1 ] is the rate configuration output bit sequence v = [v0, v1, v2, …, v N-1 ], where N is the polarization matrix size; E is the output bit sequence length; the second partial bit sequence c'=[c'0, c'1, c'2, ..., c' N-E-1 ] is achieved by configuring the output bit sequence v = [v0, v1, v2, …, v N-1 ] is determined as a repetition of the input; where Figure 4A , Figure 4B , Figure 4C and Figure 4D A specific example is given in .
[0316] Duplicates determined by a portion of the data index set Q
[0317] In some embodiments, the repeating includes obtaining, by the first node, a portion of a data index set Q of size Nq and a rate configuration output bit sequence v of length N; and determining, by the first node, the index Q for r=0, 1, 2, ..., EN-1 mod(r,Nq) ; and the first node determines the bit in the rate configuration output bit sequence v Converted into the second bit sequence c', that is:
[0318]
[0319] Here, Nq can be any positive integer not greater than K, where K is the input bit sequence length; Nq is the size of the portion of the data index set Q; the portion of the data index set Q is {Q0, Q1, Q2, ..., Q Nq-1}, i.e., the first Nq indexes in the data index set Q; the data index set Q is the same as that in the rate configuration.
[0320] In some embodiments, the size Nq of the portion of the data index set Q is determined by the input sequence length K and the repetition ratio ρ, where the repetition ratio ρ is a positive real number not greater than 1. The first specific example with the example number 1 in Table 4 is that the size of the portion of the data index set Q is Nq=K·ρ. The second specific example with the example number 2 in Table 4 is that the size of the portion of the data index set Q is Nq=floor(K·ρ). The third specific example with the example number 3 in Table 4 is that the size of the portion of the data index set Q is Nq=ceil(K·ρ). The fourth specific example with the example number 4 in Table 4 is that the size of the portion of the data index set Q is Nq=round(K·ρ). The fifth specific example with the example number 5 in Table 4 is that the size of the portion of the data index set Q is Nq=K.
[0321]
[0322] Table 4 shows the parameters K = 4, N = 8 and v = [v0, v1, ..., v N-1 ]=[v0,v1,v2,v3,v4,v5,v6,v7] as a specific example of repetition of input
[0323] Repetition according to the binary representation of the output bit sequence length E and the data index set Q
[0324] In some embodiments, the repeating includes obtaining, by the first node, a rate-configured output bit sequence v of length N and a portion of a data index set Q of size Nq; and determining, by the first node, n+1 bits of a binary representation of the output bit sequence length E. Right now, Where n = 2 n ; and by the first node according to a portion of the data index set Q of length Nq and n bits To determine n repeated index sequences Q (n -1) , Q (n-2) , …, Q (1) , Q (0) ; The first node configures the output bit sequence v and n repetition index sequences Q according to the rate of length N (n-1) , Q (n-2) , …, Q (1) , Q (0) Determine n repeated subsequences c' (n-1) ,c'(n-2) ,…,c' (1) ,c' (0) ; and determining a second partial bit sequence c' by the first node, so that the second partial bit sequence c' is n repeated subsequences c' (n-1) ,c' (n-2) ,…,c' (1) ,c' (0) cascade, that is, c'=[c' (n-1) ,c' (n-2) ,…,c' (1) ,c' (0) ] or c'=[c' (0) ,c' (1) ,…,c' (n-2) ,c' (n-1) ].
[0325] Here, N is the size of the polarization matrix; the portion of the data index set Q includes the first Nq elements Q0, Q1, Q2, ..., Q in the data index set Q. Nq-1 ;
[0326] For i=0, 1, ..., n-1, the i-th repetition index sequence Q (i) Determined as:
[0327] (1) If The first node determines the i-th repeated index sequence Q (i) is an empty index sequence; and
[0328] (2) If
[0329] ① The first node determines the i-th repeated subsequence Q (i) The length is as well as
[0330] ② The first node determines the i-th repeated index sequence Q based on the part of the data index set Q of size Nq (i) for:
[0331]
[0332] For i=0, 1, ..., n-1, the i-th repeated subsequence c' (i) Determined as:
[0333] (1) If the i-th repeated subsequence Q (i) is an empty index sequence, then the first node determines the i-th repeated subsequence c' (i) is a vacancy sequence;
[0334] (2) If the i-th repeated subsequence Q (i)is not an empty index sequence, the i-th repeated subsequence c' is determined as follows (i) .
[0335] ① Determine the i-th repeated subsequence c' by the first node (i) The length of the i-th repetition index sequence Q (i) The length of the i-th repeated subsequence c' (i) The length is
[0336] ② Determine the i-th repeated subsequence c' by the first node (i) for:
[0337]
[0338] Repetition according to a repetition index sequence R with elements in the data index set Q
[0339] In some embodiments, repeating includes obtaining, by the first node, a rate configuration output bit sequence v=[v0, v1, v2, ..., v N-1 ]; and the first node according to the length of Nr repeated index sequence R = [R0, R1, ..., R Nr-2 ,R Nr-1 ] Determine the second partial bit sequence c' as:
[0340]
[0341] Here, Nr=EN is the length of the repetition index sequence; for r=0, 1, 2, ..., Nr-1, R r belongs to the data index set Q = {Q0, Q1, ..., Q K-1}; where K is the input bit sequence length; N is the polarization matrix size; and E is the output bit sequence length.
[0342] The parameters are the first specific example of input bit sequence length K=4, polarization matrix size N=8, output bit sequence length E=11, repetition index sequence length Nr=EN=11-8=3, rate configuration output bit sequence v=[v0,v1,v2,…,v N-1 ]=[v0,v1,v2,v3,v4,v5,v6,v7]、data index set Q={Q0,Q1,…,Q K-1}={Q0,Q1,Q2,Q3}={3,5,6,7}, and repeat the index sequence R=[R0,R1,…,R Nr-2 ,R Nr-1 ]=[R0,R1,R2]=[Q3,Q0,Q1]=[6,3,5], then, the second part bit sequence
[0343] The parameters are input bit sequence length K=4, polarization matrix size N=8, output bit sequence length E=11, repetition index sequence length Nr=EN=11-8=3, rate configuration output bit sequence v=[v0,v1,v2,…,v N-1 ]=[v0,v1,v2,v3,v4,v5,v6,v7]、data index set Q={Q0,Q1,…,Q K-1}={Q0,Q1,Q2,Q3}={3,5,6,7}, and repeat the index sequence R=[R0,R1,…,R Nr-2 ,R Nr-1 ]=[R0,R1,R2]=[Q0,Q0,Q1]=[3,3,5], then, the second part bit sequence
[0344] In the third specific example, the input bit sequence length K=4, the polarization matrix size N=8, the output bit sequence length E=14, the repetition index sequence length Nr=EN=14-8=6, and the rate configuration output bit sequence v=[v0,v1,v2,…,v N-1 ]=[v0,v1,v2,v3,v4,v5,v6,v7],data index set Q={Q0,Q1,…,Q K-1}={Q0,Q1,Q2,Q3}={3,5,6,7}, and repeat the index sequence R=[R0,R1,…,R Nr-2 ,R Nr-1 ]=[R0,R1,R2,R3,R4,R5]=[Q0,Q0,Q1,Q2,Q2,Q2]=[3,3,5,6,6,6], the second part of the bit sequence Repetition according to the repetition index sequence R and repetition number sequence T of the elements in the data index set Q
[0345] In some embodiments, repeating includes obtaining, by the first node, a rate configuration output bit sequence v=[v0, v1, v2, ..., v N-1 ]; and the first node according to the length of Nr repeated index sequence R = [R0, R1, ..., R Nr-2 ,R Nr-1 ] and a repetitive sequence of length Nr T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] to determine a second partial bit sequence c', the second partial bit sequence c' comprising the Rth r Bits T r copies.
[0346] and a portion of the input bit sequence c, a repeating index sequence R = [R0, R1, ..., R Nr-2 ,R Nr-1 ] and the repeating number sequence T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] A specific example of the repetition of the second partial bit sequence c' corresponding to ] is as follows:
[0347]
[0348] Here, Nr is a positive integer not greater than the length K of the input bit sequence; for r = 0, 1, 2, ..., Nr-1, R r belongs to the data index set Q = {Q0, Q1, ..., Q K-1}; for any two indices r0≠r1 but R r0 ≠R r1 ; For r = 0, 1, 2, ..., Nr, the repeating number sequence T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] r is a positive integer; the repeating number sequence T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] equals EN, that is, Where K is the input bit sequence length, N is the polarization matrix size, and E is the output bit sequence length.
[0349] In the first specific example with parameters K=4, N=8, E=14, the rate configuration outputs a bit sequence v=[v0, v1, v2, ..., v N-1 ]=[v0,v1,v2,v3,v4,v5,v6,v7],data index set Q={Q0,Q1,…,Q K-1}={Q0,Q1,Q2,Q3}={3,5,6,7}, a repeating index sequence R=[R0,R1,R2]=[Q2,Q3,Q1]=[6,7,5] of length Nr=3, and a repeating number sequence T=[T0,T1,…,T Nr-1 ]=[2,1,3], then the output bit sequence v=[v0,v1,v2,…,v N-1 ]=The second partial bit sequence corresponding to a part of [v0,v1,v2,v3,v4,v5,v6,v7]
[0350] In the second specific example where parameters K=4, N=8, and E=13, the rate configuration outputs a bit sequence v=[v0, v1, v2, ..., v N-1]=[v0,v1,v2,v3,v4,v5,v6,v7],data index set Q={Q0,Q1,…,Q K-1}={Q0,Q1,Q2,Q3}={3,5,6,7}, a repeating index sequence R=[R0,R1,R2]=[Q2,Q3,Q1]=[6,7,5] of length Nr=3, and a repeating number sequence T=[T0,T1,…,T Nr-1 ]=[2,1,2], where T0+T1+T2=2+1+2=5=EN=13-8, and the rate configuration output bit sequence v=[v0,v1,…,v N-1 ]=The second partial bit sequence corresponding to a part of [v0,v1,v2,v3,v4,v5,v6,v7]
[0351] Embodiment 14
[0352] This section introduces an example involving a second interleaving operation after a concatenation operation.
[0353] Example 14 is based on the above-mentioned related embodiments.
[0354] In some embodiments, the output sequence e = [e0, e1, ..., e E-1 ] is further interleaved into a second output bit sequence f = [f0, f1, ..., f E-1 ], where E is the length of the output sequence e; the second output bit sequence f = [f0, f1, ..., f E-1 ] is the output sequence e=[e0,e1,…,e E-1 ] replacement.
[0355] Embodiment 15
[0356] This section discloses examples involving modulation after rate matching or second interleaving.
[0357] Example 15 is based on the above example.
[0358] In some embodiments, the output sequence e=[e0, e1, ..., e E-1 ] is further modulated into the first output symbol sequence x = [x0, x1, ..., x E / Qm-1 ]:
[0359] π / 2 binary phase shift keying (π / 2-BPSK),
[0360] Binary Phase Shift Keying (BPSK),
[0361] Quadrature Phase Shift Keying (QPSK),
[0362] Quadrature Amplitude Modulation (QAM),
[0363] Phase Shift Keying (PSK),
[0364] Amplitude Shift Keying (ASK),
[0365] Amplitude Phase Shift Keying (APSK).
[0366] Here Q m is the modulation order.
[0367] In some embodiments, the second output bit sequence f=[f0, f1, ..., f E-1 ] is further modulated into the first output symbol sequence x = [x0, x1, ..., x E / Qm-1 ]:
[0368] π / 2 binary phase shift keying (π / 2-BPSK),
[0369] Binary Phase Shift Keying (BPSK),
[0370] Quadrature Phase Shift Keying (QPSK),
[0371] Quadrature Amplitude Modulation (QAM),
[0372] Phase Shift Keying (PSK),
[0373] Amplitude Shift Keying (ASK),
[0374] Amplitude Phase Shift Keying (APSK).
[0375] Here, Q m is the modulation order.
[0376] Example 16
[0377] This section discloses examples involving an input sequence c that includes CRC bits.
[0378] Example 16 is based on the above example.
[0379] In some embodiments, the input sequence c comprises a cyclic generator polynomial g'(D)=g' with coefficients over GF(2) Lcrc ·D Lcrc +g' Lcrc-1 ·D Lcrc-1 +…+g'2·D 2 +g'1·D+g'0 determines the Lcrc cyclic redundancy check (CRC) bits and K-Lcrc payload bits.
[0380] In some embodiments, the input sequence c is determined by the first node by appending Lcrc cyclic redundancy check (CRC) bits to a payload sequence of length K-Lcrc, where the Lcrc CRC bits are generated by a cyclic generator polynomial g'(D)=g' with coefficients over GF(2). Lcrc ·D Lcrc +g' Lcrc-1 ·D Lcrc-1 +…+g'2·D 2 +g'1·D+g'0.
[0381] Examples based on the disclosed embodiments
[0382] Example 1 : In Example 1, the first partial bit sequence of the output bit sequence e of length E is the interleaved output bit sequence d' of length N. In Example 1, the first node obtains an input bit sequence of length K=179
[0383] c=[c0,c1,c2,c3,c4,c5,c6,c7,c8,c9,…,c 165 ,c 166 ,c 167 ,c 168 ,c 169 ,c 170 ,c 171 ,c 172 ,c 173 ,c 174 ,c 175 ,c 176 ,c 177 ,c 178 ], where the input sequence c includes Lcrc=19 cyclic redundancy check (CRC) bits and K-Lcrc=179-19=160 payload bits, where the CRC bits are generated by the cyclic generator polynomial g'(D)=g' Lcrc ·D Lcrc +g' Lcrc-1 ·D Lcrc-1 +…+g'2·D 2 +g'1·D+g'0=D 19 +D 18 +D 15 +D 9 +D 8 +D 5 +D 4 +D 3 +D 2 +1 for confirming.
[0384] like Figure 4BAs shown, the first node performs the following operations according to the polarization transformation matrix G with a size of N=256: (256) To determine the output bit sequence of length E = 264, e = [e0, e1, e2, e3, e4, e5, e6, e7, e8, e9, e 10 ,e 11 ,e 12 ,e 13 ,e 14 ,e 15 ,…,e 253 ,e 254 ,e 255 ,e 256 ,e 257 ,e 258 ,e 259 ,e 260 ,e 261 ,e 262 ,e 263 ]:
[0385] (1) According to the data bit index set Q = {Q0, Q1, Q2, ..., Q 177 ,Q 178= {29,43,98,88,140,30,146,71,161,45,100,51,148,46,75,104,162,53,193,152,77,164,54,83,57,112,135,78,194,85,58,168,139,99,86,60,89,196,141,101,147,176,142,31,200,90,149,102,105,163,92,47,2 08,150,153,165,106,55,113,154,79,108,224,166,195,59,169,114,156,87,197,116,170,61,177,91,198,172,120,201,62,143,103,178,93,202,107,180,151,209,94,204,155,210,109,184,115,167,225,157,110, 117,212,171,226,216,158,118,173,121,199,179,228,174,122,203,63,181,232,124,205,182,211,185,240,206,95,213,186,227,111,214,188,217,229,159,119,218,230,233,175,123,220,183,234,125,241,207, 187,236,126,242,244,189,215,219,231,248,190,221,235,222,237,243,238,245,127,191,246,249,250,252,223,239,251,247,253,254,255}, where K = 179 elements, for an input bit sequence c = [c0,c1,c2,c3,c4,c5,c6,c7,c8,c9,…,c 165 ,c 166 ,c 167 ,c 168 ,c 169 ,c 170 ] performs rate configuration, and finally generates a rate configuration output bit sequence v = [v0,v1,v2,v3,v4,v5,v6,v7,…,v 253 ,v 254 ,v 255 ],Right now:
[0386]
[0387] The data bit index set Q is calculated according to the reliability of the polarization channel according to W(Q0) <W(Q1)<W(Q2)<…<W(Q 177 ) <W(Q 178 ) in ascending order.
[0388] (2) Using a polarization matrix of size N = 256 Set the rate configuration output bit sequence v = [v0,v1,v2,v3,v4,v5,v6,v7,…,v 253 ,v 254 ,v 255 ] as the polarization conversion input bit sequence to perform polarization conversion to obtain a polarization conversion output bit sequence d = [d0, d1, d2, d3, d4, d5, d6, d7, ..., d 253 ,d 254 ,d 255 ], that is, d = u·G (256) , where the matrix operation is on GF(2), is the matrix P (2) The 8th Kronecker power of .
[0389] (3) For the polarization transformation output bit sequence d = [d0, d1, ..., d N-1 ]=[d0,d1,d2,d3,d4,d5,d6,d7,…,d 253 ,d 254 ,d 255 ] performs interleaving and determines the interleaved output bit sequence d'=[d'0, d'1, ..., d' N-1 ]=[d'0,d'1,d'2,d'3,d'4,d'5,d'6,d'7,…,d' 253 ,d' 254 ,d' 255 ] has a length of N=256, as shown below:
[0390]
[0391] For i=0, 1, 2, 3, 4, 5, 6, 7, ..., 253, 254, 255, the i-th bit of the interleaved output bit sequence d' is equal to the j-th bit of the interleaved input bit sequence d i bits, where J = [J0, J1, ..., J N-2 ,J N-1 ]=[J0,J1,J2,J3,J4,J5,J6,J7,…,J 253 ,J 254 ,J 255]=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,32,33,34,35,36,37,38,39,24,25,26,27,28,29,30,31,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,128,129,130,131,132,133,134,135 ,72,73,74,75,76,77,78,79,136,137,138,139,140,141,142,143,80,81,82,83,84,85,86,87,144,145,146,147,148,149,150,151,88,89,90,91,92,93,94,95,152,153,154,155,156,157,158,159,96,97,98,99,100,101,102,103,160,161,162,163,164,165,166,167,104,105,106 ,107,108,109,110,111,168,169,170,171,172,173,174,175,112,113,114,115,116,117,118,119,176,177,178,179,180,181,182,183,120,121,122,123,124,125,126,127,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206 ,207,208,209,210,211,212,213,214,215,224,225,226,227,228,229,230,231,216,217,218,219,220,221,222,223,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255] is based on the subblock interleaver pattern π=[π0,π1,π2,π3,π4,π5,π6,π7,π8,π9,π 10 ,p 11 ,p12 ,π 13 ,π 14 ,π 15 ,π 16 ,π 17 ,π 18 ,π 19 ,π 20 ,π 21 ,π 22 ,π 23 ,π 24 ,π 25 ,π 26 ,π 27 ,π 28 ,π 29 ,π 30 ,π 31 ]=[0,1,2,4,3,5,6,7,8,16,9,17,10,18,11,19,12,20,13,21,14,22,15,23,24,25,26,28,27,29,30,31], as shown below:
[0392]
[0393] (4) The output bit sequence e = [e0, e1, ..., e 263 The first part of the bit sequence of ] is set to the interleaved output bit sequence d'=[d'0, d'1, d'2, ..., d' 255 ].
[0394] (5) Output bit sequence v = [v0, v1, v2, v3, v4, v5, v6, v7, ..., v 253 ,v 254 ,v 255 ] Repeat to obtain a second partial bit sequence c'=[c'0, c'1, c'2, ..., c' E-N-1 ]=[c'0,c'1,c'2,c'3,c'4,c'5,c'6,c'7], because the data index set Q with a length of K=179 is obtained by the first node; and the index Q for r=0, 1, 2, ..., EN-1 is determined mod(r,K) ; and the first node determines the bit in the rate configuration output bit sequence v is the rth bit of the second partial bit sequence c', that is, r=0,1,2,…,EN-1. Finally, the second bit sequence
[0395] (6) The interleaving output bit sequence d' = [d'0, d'1, d'2, ..., d' 255 ] and the second partial bit sequence c'=[c'0,c'1,c'2,c'3,c'4,c'5,c'6,c'7]=[v 29 ,v 43 ,v 98 ,v 88 ,v 140 ,v 30 ,v 146 ,v 71 ] to obtain the output bit sequence e = [e0, e1, e2, ..., e 255 ,e 256 ,e 257 ,e 258 ,e 259 ,e 260 ,e 261 ,e 262 ,e 263 ], that is, e=[e0,e1,e2,…,e 255 ,e 256 ,e 257 ,e 258 ,e 259 ,e 260 ,e 261 ,e 262 ,e 263 ]=[d',c']=[d'0,d'1,d'2,…,d' 255 ,c'0,c'1,c'2,c'3,c'4,c'5,c'6,c'7]=[d'0,d'1,d'2,…,d' 255 ,v 29 ,v 43 ,v 98 ,v 88 ,v 140 ,v 30 ,v 146 ,v 71 ].
[0396] The first node transmits a signal including an output bit sequence e to the second node. Figure 7 The block error rate of Example 1 on an AWGN channel is shown, where the solid line represents the method in Example 1 and the dotted line represents the 5G polar coding scheme. Figure 7 It can be seen that when the block error rate is 0.001, the new method achieves a coding gain of more than 0.1dB compared with the 5G polar coding scheme.
[0397] Example 2: The only difference between Example 2 and Example 1 is that step (5) is performed by configuring the rate output bit sequence v = [v0, v1, v2, v3, v4, v5, v6, v7, ..., v 253 ,v 254 ,v 255 ] Repeat to obtain a second partial bit sequence c'=[c'0, c'1, c'2, ..., c' E-N-1 ]=[c'0,c'1,c'2,c'3,c'4,c'5,c'6,c'7], that is, the first node obtains a part of the data index set Q with a length of Nq=9, namely {Q0,Q1,Q2,Q3,Q4,Q5,Q6,Q7,Q8}; and the first node determines the index Q for r=0,1,2,…,EN-1 mod(r,Nq) ; and the first node determines the bit in the rate configuration output bit sequence v Converted into the second bit sequence c', that is:
[0398]
[0399] Finally, the second bit sequence
[0400]
[0401] Example 3 : The only difference between Example 3 and Example 1 is that step (5) is performed as follows:
[0402] For rate configuration, output bit sequence v = [v0,v1,v2,v3,v4,v5,v6,v7,…,v 253 ,v 254 ,v 255 ] Repeat to obtain a second partial bit sequence c'=[c'0, c'1, c'2, ..., c' E-N-1 ]=[c'0,c'1,c'2,c'3,c'4,c'5,c'6,c'7], that is, the first node obtains a rate configuration output bit sequence v=[v0,v1,v2,v3,v4,v5,v6,v7,…,v 253 ,v 254 ,v 255 ]; and obtain a data index set Q with a length of K=179 from the first node, that is, Q={Q0,Q1,Q2,Q3,…,Q 177 ,Q 178}; and the first node determines n+1=8+1=8 bits is the binary representation of the output bit sequence length E = 264, that is, Where n = 2 8 ; and by the first node according to the size K = 179 and n = 8 bits Determine n = 8 data index sets Q (7) , Q (6) , Q (5) , Q (4) , Q (3) , Q (2) , Q (1) , Q (0) ,Right now:
[0403] (i) Due to The first node determines the repeated index sequence Q (7) , Q (6) , Q (5) , Q (4) , Q (2) , Q (1) , Q (0) is an empty index sequence; since b3 (264) =1,
[0404] The first node determines the Q of the third repeated subsequence (3) Length is
[0405] (ii) The first node determines a third repetitive index sequence Q based on a data index set Q of length K=179. (3) ,Right now
[0406]
[0407] 40,30,146,71]; and the second partial bit sequence c' is determined by the first node as follows.
[0408] (i) Due to the repeated index sequence Q (7) , Q (6) , Q (5) , Q (4) , Q (2) , Q (1) , Q (0) Empty; confirm the weight
[0409] Complex subsequence c' (7) =c' (6) =c' (5) =c' (4) =c' (2) =c' (1) =c' (0) =[];
[0410] (ii) Due to the repeated index sequence Q(3) The length of E3 is 8, so the third repeated subsequence c' (3) Length
[0411] E3 = 8;
[0412] (iii) Determine the third repeat subsequence
[0413]
[0414] (iv) Repeat the n=8 subsequences c' (7) , c' (6) , c' (5) , c' (4) , c' (3) , c' (2) , c' (1) , c' (0) Concatenated to the second bit sequence is c'=[c' (7) ,c' (6) ,c' (5) ,c' (4) ,c' (3) ,c' (2) ,c' (1) ,c' (0) ]=c' (3) =[v 29 ,v 43 ,v 98 ,v 88 ,v 140 ,v 30 ,v 146 ,v 71 ].
[0415] Finally, the second partial bit sequence c'=[v 29 ,v 43 ,v 98 ,v 88 ,v 140 ,v 30 ,v 146 ,v 71 ].
[0416] Figure 8 An exemplary block diagram of a hardware platform 800 is shown, which may be part of a network device (e.g., a base station) or a communication device (e.g., a user equipment (UE)). The hardware platform 800 includes at least one processor 810 and a memory 805 having instructions stored thereon. The instructions when executed by the processor 810 configure the hardware platform 800 to perform Figures 1 to 7The operations in the embodiments described in the present application and the operations in the various embodiments described in the present application. The transmitter 815 transmits or sends information or data to another device. For example, the network device transmitter can send a message to the user device. The receiver 820 receives information or data transmitted or sent by another device. For example, the user device can receive a message from the network device.
[0417] The above-described embodiments will be applied to network communications. Fig. 9 An example of a communication system (e.g., a 5G or NR cellular network) including a base station 920 and one or more user equipment (UE) 911, 912, and 913 is shown. In some embodiments, the UE uses a communication link to the network (sometimes referred to as an uplink direction, as depicted by dashed arrows 931, 932, 933) to access the BS (e.g., the network), which then enables subsequent communication from the BS to the UE (e.g., shown in the direction from the network to the UE, sometimes referred to as a downlink direction, as shown by arrows 941, 942, 943). In some embodiments, the BS sends information to the UE (sometimes referred to as a downlink direction, as depicted by arrows 941, 942, 943), which then enables subsequent communication from the UE to the BS (e.g., shown in the direction from the UE to the BS, sometimes referred to as an uplink direction, as shown by dashed arrows 931, 932, 933). The UE can be, for example, a smartphone, a tablet, a mobile computer, a machine-to-machine (M2M) device, an Internet of Things (IoT) device, etc.
[0418] Fig.10 An example flow chart representation of a method for digital communication according to one or more embodiments of the present application is shown. Operation 1002 includes determining, by a first node, an output bit sequence having E bits based on an input bit sequence c having K bits, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a portion of the bit sequence before the polarization transformation. Operation 1004 includes transmitting, by the first node, a signal including the output bit sequence to a second node.
[0419] Fig.11 Another example flow chart representation of a digital communication method according to one or more embodiments of the present application is shown. Operation 1102 includes receiving, by a second node, a signal including an output bit sequence having E bits from a first node. Operation 1104 includes determining, by the second node, an input bit sequence c having K bits based on the signal, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a portion of the bit sequence before the polarization transformation.
[0420] Fig.10 and Fig.11 Various preferred embodiments and additional features of the above method are as follows. Further examples are described with reference to embodiments 1 to 16.
[0421] In some embodiments, the portion of the bit sequence before polarization conversion is a portion of the input bit sequence c. In some embodiments, the method further comprises a rate configuration operation, wherein an input of the rate configuration operation is based on the input bit sequence c, wherein the portion of the bit sequence before polarization conversion is a portion of an output of the rate configuration operation.
[0422] In some embodiments, the repetition operation includes: obtaining, by the first node, a portion of the input bit sequence c; and, by the first node, repetition index sequence R=[R0, R1, . . . , R Nr-2 ,R Nr-1 ] Determine the second bit sequence c', that is r=0,1,2,…,Nr, where Nr is a predefined integer. In some embodiments, for r=0,1,2,…,Nr-1, R r Less than K. In some embodiments, for r=0, 1, 2, ..., Nr-1, R r Less than N, where N is the size of the polarization matrix of the polarization transformation. In some embodiments, R r Satisfy one of the following: R r is an integer less than K, R r Less than N, where N is the polarization matrix size of the polarization transformation.
[0423] In some embodiments, the repetition operation includes: obtaining, by the first node, a portion of the input bit sequence c; and, by the first node, according to a repetition index R=[R0, R1, . . . , R Nr-2 ,R Nr-1 ] and the repeating number sequence T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] to determine the second bit sequence c', so that for r = 0, 1, 2, ..., Nr-1, c' includes the Rth part of the input bit sequence c r bits of T r In some embodiments, R r is an integer less than K. In some embodiments, for r=0, 1, 2, ..., Nr-1, R r Less than N, where N is the size of the polarization matrix of the polarization transformation. In some embodiments, R r Satisfy one of the following: R r is an integer less than K, R r Less than N, where N is the polarization matrix size of the polarization transformation.
[0424] In some embodiments, the repeating operation includes: obtaining, by the first node, a rate configuration output bit sequence v=[v0, v1, v2, ..., v N-1 ] and a data index set Q = {Q0, Q1, ..., Q K-1}, where Nq is a positive integer, and the rate configuration output bit sequence v = [v0, v1, v2, ..., v N-1 ] is the output of the rate configuration operation; the first node determines the index Q for r = 0, 1, 2, ..., EN-1 mod(r,Nq) ; and the first node configures the portion of the rate output bit sequence v having an index Q mod(r,Nq) Bit Determined as the bits in the repeated output bit sequence c', that is, for r = 0, 1, 2, ... EN-1, In some embodiments, Nq is less than or equal to K. In some embodiments, for r=0, 1, 2, ..., Nr-1, R r Less than N, where N is the polarization matrix size of the polarization transformation.
[0425] In some embodiments, the output bit sequence is determined by further performing a rate configuration operation based on the input bit sequence. In some embodiments, the input of the repetition operation is based on the output of the rate configuration operation. In some embodiments, the data bit index set Q = {Q0, Q1, ..., Q K-1}For the input bit sequence c=[c0,c1,…,c K-1 ] performs the rate configuration operation to obtain the rate configuration output bit sequence v = [v0, v1, ..., v N-1 ].
[0426] In some embodiments, the method further comprises performing a pre-transform operation, wherein the input of the pre-transform operation is based on the input sequence. In some embodiments, the input of the pre-transform operation is based on the output of the rate configuration operation. In some embodiments, the bits in the output of the pre-transform operation are determined by a convolution bit sequence or a convolution polynomial. In some embodiments, the convolution bit sequence comprises a generator bit sequence g=[g0, g1, ..., g m ], or the recursive feedback bit sequence q=[q0,q1,…,q m In some embodiments, the convolution polynomial includes a generator polynomial g(D)=g0+g1·D+…+g m-1 ·D m-1 +g m ·D m , or the recursive feedback polynomial q(D) = q0 + q1·D + ... + q m-1 ·D m-1 +q m ·Dm .
[0427] In some embodiments, the polarization transformation is performed based on the polarization matrix. In some embodiments, the output bit sequence is further determined by performing an interleaving operation, wherein the input of the interleaving operation is based on the input bit sequence. In some embodiments, the interleaving operation is performed by an interleaving pattern J=[J0, J1, J2, ..., J N-2 ,J N-1 ] determined, where N is an integer greater than 1. In some embodiments, the input of the interleaving operation is based on the output of the polarization transformation.
[0428] In some embodiments, the method further comprises performing a cascade operation, wherein the input of the cascade operation is based on an input sequence. In some embodiments, the input of the cascade operation is based on an output of a repetitive operation. In some embodiments, the input of the cascade operation is based on an output of a polarization transformation. In some embodiments, the input of the cascade operation is based on an output of an interleaving operation.
[0429] It should be understood that the present application discloses methods and devices related to rate matching schemes applied to polar coding, PAC coding or other pre-transformed polar coding. In the 5G mobile communication standard of 3GPP, low-density parity-check (LDPC) codes are used for data transmission. However, compared with polar codes, LDPC has certain disadvantages in terms of short payload size (also known as transport block size (TBS)). Alternatively, PAC codes can achieve finite length boundaries at moderate decoding complexity. PAC codes have the same code length as polar codes, a power of 2 (N=2 n , where n is a positive integer). However, in order to effectively transmit the payload (or transport block (TB)) in different wireless channel environments, it is not always necessary to have N=2 in the time and frequency resources allocated by the base station (BS). n Therefore, the application of PAC codes in wireless communications requires a rate matching scheme.
[0430] The disclosed and other embodiments, modules and functional operations described in this application can be implemented in digital electronic circuits, or in computer software, firmware or hardware, including the structures disclosed in this application and their structural equivalents, or in a combination of one or more thereof. The disclosed embodiments and other embodiments can be implemented in one or more computer program products, that is, modules of one or more computer program instructions encoded on a computer-readable medium for execution or control of its operation by a data processing device. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a storage device, a composition of matter that affects a machine-readable propagation signal, or one or more combinations thereof. The term "data processing device" includes all devices, equipment and machines for processing data, including, for example, a programmable processor, a computer or multiple processors or multiple computers. In addition to hardware, the device can also include code that creates an execution environment for the computer program in question, for example, code that constitutes a processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more thereof. A propagation signal is an artificially generated signal, for example, a machine-generated electrical, optical or electromagnetic signal, which is generated to encode information for transmission to a suitable receiver device.
[0431] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions). A computer program can be deployed to execute on one computer or on multiple computers located at one site or distributed across multiple sites and interconnected by a communications network.
[0432] The processes and logic flows described in this document can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and the apparatus can also be implemented with, special purpose logic circuitry, for example, an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
[0433] For example, processors suitable for executing computer programs include general and special purpose microprocessors, and any one or more processors of any type of digital computer. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more storage devices for storing instructions and data. Typically, a computer will also include or be operatively coupled to receive data or transfer data to both one or more mass storage devices (e.g., magnetic, magneto-optical, or optical disks) for storing data. However, a computer need not have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including, for example, semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM optical disks. The processor and memory may be supplemented by or incorporated into dedicated logic circuits.
[0434] Although this document contains many details, these details should not be interpreted as limitations on the scope of the claimed invention or the content that may be claimed, but should be interpreted as descriptions of specific features of specific embodiments. Certain features described herein in the context of separate embodiments can also be implemented in combination in a single embodiment. On the contrary, the various features described in the context of a single embodiment can also be implemented individually or in any suitable sub-combination in multiple embodiments. In addition, although the above-mentioned features may be described as working in the form of certain combinations, or even initially claimed as such, in some cases, one or more features in the claimed combination can be deleted from the combination, and the claimed combination can point to a sub-combination or a variant of the sub-combination. Similarly, although the operations are described in a specific order in the accompanying drawings, this should not be understood as requiring the operations to be performed in the specific order or sequential order shown, or requiring the execution of all illustrated operations to achieve the desired results.
[0435] Only a few examples and implementations are disclosed herein. Variations, modifications and enhancements may be made to the described examples and implementations and other implementations based on what is disclosed.
Claims
1. A method for digital communication, the method comprising: Determining, by a first node, an output bit sequence having E bits based on an input bit sequence c having K bits, wherein the output bit sequence is determined by performing a polarization conversion and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization conversion and an output of the repetition operation; wherein an input of the repetition operation is a portion of the bit sequence before the polarization conversion; and A signal including the output bit sequence is transmitted from the first node to the second node.
2. A method for digital communication, the method comprising: receiving, by the second node from the first node, a signal comprising an output bit sequence having E bits; as well as The second node determines an input bit sequence c having K bits based on the signal, wherein the output bit sequence is determined by performing a polarization transformation and a repetition operation; wherein the output bit sequence is determined based on an output of the polarization transformation and an output of the repetition operation; wherein the input of the repetition operation is a part of the bit sequence before the polarization transformation.
3. The method according to claim 1 or 2, wherein: The portion of the bit sequence before the polarization conversion is a portion of the input bit sequence c.
4. The method according to claim 1 or 2, further comprising a rate configuration operation, wherein: The input of the rate configuration operation is based on the input bit sequence c, wherein the portion of the bit sequence before the polarization conversion is a portion of the output of the rate configuration operation.
5. The method according to claim 1 or 2, wherein: The repeated operation includes: Obtaining, by the first node, a portion of the input bit sequence c; and The first node is configured to repeat the index sequence R=[R0, R1, ..., R Nr -2,R Nr-1 ] Determine the second bit sequence c', that is Where Nr is a predefined integer; where, for r = 0, 1, 2, ..., Nr-1, R r Meet one of the following conditions: R r Less than K, R r Less than N, where N is the polarization matrix size of the polarization transformation.
6. The method according to claim 1 or 2, wherein: The repetitive operation includes: obtaining, by the first node, a portion of the input bit sequence c; and The first node is based on the repetition index R=[R0, R1, ..., R Nr-2 ,R Nr-1 ] and the repeating number sequence T = [T0, T1, ..., T Nr-2 ,T Nr-1 ] Determine a second bit sequence c' such that for r = 0, 1, 2, ..., Nr-1, c' includes the Rth r bits of T r copies.
7. The method according to claim 6, wherein: R r is an integer less than K.
8. The method according to claim 4, wherein: The repeated operation includes: The first node obtains a rate configuration output bit sequence v=[v0,v1,v2,…,v N-1 ] and a data index set Q = {Q0, Q1, ..., Q K-1 }, where Nq is a positive integer, and the rate configuration outputs a bit sequence v = [v0, v1, v2, ..., v N-1 ] is the output of the rate configuration operation; The first node determines the index Q for r=0, 1, 2, ..., EN-1 mod(r,Nq) ;as well as The first node determines that the portion of the rate configuration output bit sequence v has an index Q mod(r,Nq) Bit is converted into the bits in the repeated output bit sequence c', that is, for r = 0, 1, 2, ... EN-1, 9. The method according to claim 8, wherein: Nq is less than or equal to K.
10. The method according to claim 1 or 2, wherein: The output bit sequence is determined by further performing a rate configuration operation based on the input bit sequence.
11. The method according to claim 10, wherein: An input to the repeat operation is based on an output of the rate configuration operation.
12. The method according to claim 10, wherein: Using the data bit index set Q = {Q0, Q1, ..., Q K-1 }For the input bit sequence c=[c0,c1,…,c K-1 ] performs the rate configuration operation to obtain the rate configuration output bit sequence v = [v0, v1, ..., v N-1 ].
13. The method of claim 1 or 2, further comprising performing a pre-transformation operation, wherein an input to the pre-transformation operation is based on the input sequence.
14. The method according to claim 13, wherein: The input to the pre-transform operation is based on the output of the rate configuration operation.
15. The method according to claim 13, wherein: The bits in the output of the pre-transform operation are determined by a convolution bit sequence or a convolution polynomial.
16. The method according to claim 15, wherein: The convolution bit sequence includes a generator bit sequence g=[g0, g1, ..., g m ], or the recursive feedback bit sequence q=[q0,q1,…,q m ].
17. The method according to claim 15, wherein: The convolution polynomial includes a generator polynomial g(D)=g0+g1·D+…+g m-1 ·D m-1 +g m ·D m , or the recursive feedback polynomial q(D) = q0 + q1·D + ... + q m-1 ·D m-1 +q m ·D m .
18. The method according to claim 1 or 2, wherein: The polarization transformation is performed based on a polarization matrix.
19. The method according to claim 1 or 2, wherein: The output bit sequence is further determined by performing an interleaving operation, wherein an input to the interleaving operation is based on the input bit sequence.
20. The method according to claim 19, wherein: The interleaving operation is performed by an interleaving pattern J=[J0, J1, J2, ..., J N-2 ,J N-1 ] determined, where N is an integer greater than 1.
21. The method according to claim 19, wherein: The input of the interleaving operation is based on the output of the polarization transformation.
22. The method according to claim 1 or 2, wherein: The method also includes performing a concatenation operation, wherein an input to the concatenation operation is based on the input sequence.
23. The method according to claim 22, wherein: The input of the cascade operation is based on the output of the repeat operation.
24. The method according to claim 22, wherein: The input of the cascade operation is based on the output of the polarization transformation.
25. The method according to claim 22, wherein: The input of the concatenation operation is based on the output of the interleaving operation.
26. An apparatus for a communication network, the apparatus comprising: A processor configured to implement the method of any one of claims 1 to 25.
27. A computer-readable storage medium having stored thereon codes which, when executed by a processor, cause the processor to implement the method of any one of claims 1 to 25.
