WO2018202142A1 - Sequence determining method and apparatus, device and storage medium - Google Patents

Sequence determining method and apparatus, device and storage medium Download PDF

Info

Publication number
WO2018202142A1
WO2018202142A1 PCT/CN2018/085645 CN2018085645W WO2018202142A1 WO 2018202142 A1 WO2018202142 A1 WO 2018202142A1 CN 2018085645 W CN2018085645 W CN 2018085645W WO 2018202142 A1 WO2018202142 A1 WO 2018202142A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit sequence
matrix
index
bits
bit
Prior art date
Application number
PCT/CN2018/085645
Other languages
French (fr)
Chinese (zh)
Inventor
陈梦竹
许进
徐俊
彭佛才
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN201710737955.9A external-priority patent/CN108809334B/en
Priority to EP18794534.0A priority Critical patent/EP3570443B1/en
Priority to JP2019560749A priority patent/JP6997214B2/en
Priority to KR1020217013466A priority patent/KR102382491B1/en
Priority to KR1020197035957A priority patent/KR102250284B1/en
Priority to AU2018261974A priority patent/AU2018261974B2/en
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP24162344.6A priority patent/EP4380061A3/en
Priority to FIEP18794534.0T priority patent/FI3570443T3/en
Publication of WO2018202142A1 publication Critical patent/WO2018202142A1/en
Priority to US16/446,605 priority patent/US10581461B2/en
Priority to US16/807,114 priority patent/US11271592B2/en
Priority to JP2021203826A priority patent/JP7332673B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes

Definitions

  • the present application relates to the field of communications, and in particular, to a sequence determining method and apparatus, device, and storage medium.
  • the channel coding service is a separate part of the mobile communication system, which ensures the reliability, accuracy and effectiveness of information transmission.
  • Polarization code coding is a rigorously proven constructive coding method for reachable channel capacity, and it can meet the requirements of communication throughput (Throughput) and Latency in 5G New RAT.
  • the reliability of each input bit is different, that is, the bit error rate (BER) of the input bits at different positions is different, so the information bits and the check bits are arranged at a higher reliability position during encoding. (ie, a position where the BER is small), arranging the known bits to a position with lower reliability can effectively reduce the block error rate (BLER) and improve the decoding performance.
  • BLER block error rate
  • the embodiment of the present application provides a sequence determining method, apparatus, device, and storage medium to solve at least the problem that there is no corresponding sequence determining method in the 5G New RAT in the related art.
  • a sequence determining method including: mapping a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; performing the second bit sequence Polarization code encoding, obtaining a bit sequence after polarization code encoding; selecting T bits from the bit sequence after polarization code encoding as a bit sequence to be transmitted; wherein K and T are positive integers, K ⁇ T.
  • the method before the first bit sequence of length K bits is mapped to the specified position according to the M_index to obtain the second bit sequence, the method further includes: obtaining the first index matrix by using the first predetermined transform. a second index matrix; obtaining M_index by the second index matrix; wherein the first predetermined transform comprises: row permutation or column permutation.
  • the method before selecting a T bit from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence, further includes: forming the bit sequence into a first bit sequence matrix after encoding the polarization code; The bit sequence matrix performs a second predetermined transform to obtain a second bit sequence matrix; wherein the second predetermined transform includes: row permutation or column permutation; and selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted includes: T bits are selected from the second bit sequence matrix as the bit sequence to be transmitted.
  • the second index matrix is M re
  • M re is a matrix of R re rows C re columns
  • the first index matrix is M or M or
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • C re when R re is constant, C re is a minimum value satisfying R re ⁇ C re ⁇ N; or, in the case where C re is constant, R re is satisfying R re ⁇ C Re ⁇ the minimum value of N.
  • the first index matrix is subjected to the first predetermined transformation to obtain the second index matrix, including at least one of the following: the ith column of M re is the ⁇ 1 (i) column of the M or the column replacement. wherein, 0 ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; j M re of the M or behavior of ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j And ⁇ 2 (j) are both positive integers.
  • the first iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to r to Then at Based on the second iteration formula, n1 iterations are updated, and the function value of each element is obtained.
  • the second iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m2 ⁇ n1, 1 ⁇ m3 ⁇ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1.
  • the fourth iteration calculation formula is among them, Is the mutual information at s; wherein, 1 ⁇ m5 ⁇ n2, 1 ⁇ m6 ⁇ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • the first bit sequence of a second predetermined matrix transformation matrix to obtain a second bit sequence comprising at least one of: the first g M vb ⁇ M og ranked in 3 (g) after column Column substitution obtained, wherein, 0 ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; M vb ⁇ h of behavior of the M og 4 (h) through the line row permutation obtained, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ (h) 4 ⁇ R vb -1, R vb ⁇ C vb ⁇ N, h and ⁇ 4 (h) are both positive integers.
  • the fifth iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to ⁇ to Then at Based on the sixth iteration formula for n3 iterations, the function value of each element is obtained.
  • the sixth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m7 ⁇ n3, 1 ⁇ m8 ⁇ n3, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
  • the seventh iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to ⁇ to Then at Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
  • the eighth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m10 ⁇ n4, 1 ⁇ m11 ⁇ n4, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
  • obtaining the M_index by using the second index matrix includes: selecting a predetermined number of indexes from the M re by row or column or diagonally, and taking a predetermined number of indexes as M_index.
  • selecting a predetermined number of indexes from the M re by the column includes: selecting K p indexes from the p- th column in the M re , wherein, p is an integer, and 1 ⁇ p ⁇ C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein q is an integer, and 1 ⁇ q ⁇ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K ⁇ indexes from the diagonal line of the ⁇ th line in M re , wherein ⁇ is an integer, and -min(R re , C re )+1 ⁇ max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
  • selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein 1 ⁇ ic1 ⁇ C 1 , 1 ⁇ C 1 ⁇ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein C 2 ⁇ ic2 ⁇ C 3 , 1 ⁇ C 2 ⁇ C 3 ⁇ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which C 4 ⁇ ic3 ⁇ C re, 1 ⁇ C 4 ⁇ C re, ic3 and C 4 are integers.
  • At least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein 1 ⁇ ir1 ⁇ R 1 , 1 ⁇ R 1 ⁇ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein R 2 ⁇ ir2 ⁇ R 3 , 1 ⁇ R 2 ⁇ R 3 ⁇ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which 1 ⁇ R 4 ⁇ R re , and ir3 and R 4 are integers.
  • selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where -min(R re , C re )+1 ⁇ D 1 ⁇ max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which -min(R re , C re )+1 ⁇ D 2 ⁇ D 3 ⁇ max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonal
  • the second bit sequence matrix is obtained by performing a second predetermined transform on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transform comprises: Replacement or column permutation.
  • selecting T bits from the second bit sequence matrix as the to-be-transmitted bit sequence includes: sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-sent Bit sequence.
  • sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the bit sequence to be transmitted includes starting from a starting position t in the second bit sequence matrix.
  • T bits are sequentially selected from the second bit sequence matrix by row or column or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the second bit is skipped
  • the last bit or the first bit in the sequence matrix continues to be selected, 1 ⁇ t ⁇ R vb ⁇ C vb .
  • the T bits are sequentially selected from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence, including: the length of the bit sequence after T is less than or equal to the polarization code encoding.
  • the first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in columns; when T is less than or equal to the length N of the bit sequence after the polarization code is encoded, The row sequentially selects the 1st to Tth bits or the Nth T+1th to Nth bits in the second bit sequence matrix; when T is less than or equal to the length N of the bit sequence after the polarization code encoding, the diagonally Selecting 1st to Tth bits or N-T+1th to Nth bits in the second bit sequence matrix; when T is greater than the length N of the bit sequence after the polarization code encoding, the tth from the second bit sequence matrix Starting at the beginning of each bit, T bits are sequentially selected in rows or columns or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit is skipped. The bits continue to be selected, where 1 ⁇ t ⁇ R vb ⁇ C vb ; Where N is a positive
  • the bit sequence from the second column of the matrix are sequentially selected by T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein 1 ⁇ E 1 ⁇ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein 1 ⁇ E 2 ⁇ E 3 ⁇ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein 1 ⁇ E 4 ⁇ C vb , ie3 and E 4 are integers.
  • the T bits are sequentially selected from the second bit sequence matrix by at least one of the following: T if1 bits are sequentially selected from the first, second, ..., F 1 rows, wherein 1 ⁇ F 1 ⁇ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein 1 ⁇ F 2 ⁇ F 3 ⁇ R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein 1 ⁇ F 4 ⁇ R vb , if3 and F 4 are integers.
  • the T bits are sequentially selected from the second bit sequence matrix in a diagonal manner, including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb )+2,...,G 1 diagonally selects T ig1 bits, of which -min(R vb , C vb ) +1 ⁇ G 1 ⁇ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which -min(R vb , C vb )+1 ⁇ G 2 ⁇ G 3 ⁇ max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C v
  • the number of columns of the M og is 32.
  • a sequence determining apparatus including: a rearrangement module configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; and an encoding module And configured to perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code is encoded; and the selecting module is configured to select T bits from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence; wherein, K And T are positive integers, K ⁇ T.
  • the apparatus further includes: a first transforming module, configured to: obtain a second index matrix by using the first predetermined transform by the first index matrix; and obtain an M_index by using the second index matrix; wherein, the first predetermined transform includes: Row permutation or column permutation.
  • the apparatus further includes: a second transform module configured to form a bit sequence of the first bit sequence matrix by encoding the bit code sequence; and performing a second predetermined transform on the first bit sequence matrix to obtain a second bit sequence a matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted.
  • a second transform module configured to form a bit sequence of the first bit sequence matrix by encoding the bit code sequence
  • the second predetermined transform comprises: row permutation or column permutation
  • the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted.
  • the second index matrix of M re, M re matrix R re row C re column, a first index matrix is M or, M or is
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • C re when R re is constant, C re is a minimum value satisfying R re ⁇ C re ⁇ N; or, in the case where C re is constant, R re is satisfying R re ⁇ C Re ⁇ the minimum value of N.
  • the first index matrix is configured to obtain the second index matrix by at least one of the following: the ith column of M re is obtained by column permutation of the ⁇ 1 (i) column of M or 0 ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; M re j-M or behavior of ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j and ⁇ 2 (j) are positive integers.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • C vb when V vb is constant, C vb is a minimum value satisfying R vb ⁇ C vb ⁇ N; or, in the case where C vb is constant, R vb is satisfying R vb ⁇ C The minimum value of vb ⁇ N.
  • the second bit sequence matrix is configured to obtain the second bit sequence matrix by at least one of the following: the gth column of the M vb is the ⁇ 3 (g) column of the M og is replaced by the column, wherein, 0 ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; M vb behavior of the h a first ⁇ M og 4 (h) through the line row permutation obtained, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ 4 (h) ⁇ R vb -1, R vb ⁇ C vb ⁇ N, h , and ⁇ 4 (h) are positive integers.
  • the number of columns of the M og is 32.
  • an apparatus comprising: a processor configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; Performing polarization code encoding to obtain a bit sequence after polarization code encoding; and selecting T bits from the bit sequence after polarization code encoding as a bit sequence to be transmitted; wherein, K and T are positive integers, K ⁇ T; , coupled to the processor.
  • the processor is further configured to: obtain a second index matrix by using a first predetermined transform by the first index matrix; and obtain an M_index by using the second index matrix; where the first predetermined transform includes: row permutation or column permutation .
  • the processor is further configured to: compose the bit sequence encoded by the polarization code into a first bit sequence matrix; perform a second predetermined transform on the first bit sequence matrix to obtain a second bit sequence matrix;
  • the T bits are selected as the to-be-transmitted bit sequence in the two-bit sequence matrix, and the second predetermined transform includes: row permutation or column permutation.
  • the second index matrix is M re
  • M re is a matrix of R re rows C re columns
  • the first index matrix is M or M or
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • C re when R re is constant, C re is a minimum value satisfying R re ⁇ C re ⁇ N; or, in the case where C re is constant, R re is satisfying R re ⁇ C Re ⁇ the minimum value of N.
  • the processor is further configured to obtain, by at least one of the following, the second index matrix: the ith column of M re is obtained by column permutation of the ⁇ 1 (i) column of M or , where 0 ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; M or behavior of the j-th of the M re ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j and ⁇ 2 (j ) are positive integers.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • C vb when V vb is constant, C vb is a minimum value satisfying R vb ⁇ C vb ⁇ N; or, in the case where C vb is constant, R vb is satisfying R vb ⁇ C The minimum value of vb ⁇ N.
  • the processor is further configured to obtain the second bit sequence matrix by at least one of the following: the gth column of the M vb is the ⁇ 3 (g) column of the M og , and the column is replaced by, where, ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; h-M vb behavior of the M og of ⁇ 4 (h) through the line row permutation obtained, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ 4 (h) ⁇ R vb -1, R vb ⁇ C vb ⁇ N, h and ⁇ 4 ( h) are positive integers.
  • the number of columns of the M og is 32.
  • a storage medium comprising a stored program, wherein the program is executed to perform the method of any of the above.
  • a processor configured to execute a program, wherein the program is executed to perform the method of any of the above.
  • a first bit sequence of length K bits is mapped to a specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding;
  • the T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
  • FIG. 1 is a block diagram showing a hardware structure of a mobile terminal according to a sequence determining method according to an embodiment of the present application
  • FIG. 3 is a structural block diagram of a sequence determining apparatus according to an embodiment of the present application.
  • FIG. 4 is a structural block diagram of a device according to Embodiment 3 of the present application.
  • FIG. 1 is a hardware structural block diagram of a mobile terminal of a sequence determining method according to an embodiment of the present application.
  • the mobile terminal 10 may include one or more (only one shown) processor 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA).
  • FIG. 1 is merely illustrative and does not limit the structure of the above electronic device.
  • the mobile terminal 10 may also include more or fewer components than those shown in FIG. 1, or have a different configuration than that shown in FIG.
  • the memory 104 can be used to store software programs and modules of application software, such as program instructions/modules corresponding to the sequence determining method in the embodiment of the present application, and the processor 102 executes various programs by running software programs and modules stored in the memory 104. Functional application and data processing, that is, the above method is implemented.
  • Memory 104 may include high speed random access memory, and may also include non-volatile memory such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory.
  • memory 104 may further include memory remotely located relative to processor 102, which may be connected to mobile terminal 10 over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • Transmission device 106 is for receiving or transmitting data via a network.
  • the above-described network specific example may include a wireless network provided by a communication provider of the mobile terminal 10.
  • the transmission device 106 includes a Network Interface Controller (NIC) that can be connected to other network devices through a base station to communicate with the Internet.
  • the transmission device 106 can be a Radio Frequency (RF) module for communicating with the Internet wirelessly.
  • NIC Network Interface Controller
  • RF Radio Frequency
  • Embodiment 1 of the present application may also be performed in a network side device, such as a base station, but is not limited thereto.
  • FIG. 2 is a flowchart of a sequence determining method according to an embodiment of the present application. As shown in FIG. 2, the process includes the following steps. :
  • Step S202 mapping a first bit sequence of length K bits to a specified position according to M_index, to obtain a second bit sequence
  • Step S204 performing polarization code encoding on the second bit sequence to obtain a bit sequence after encoding the polarization code
  • Step S206 selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein K and T are positive integers, K ⁇ T.
  • the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding;
  • the T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
  • the method may further include: obtaining a second index matrix by using a first predetermined transform by the first index matrix; obtaining an M_index by using the second index matrix; wherein the first predetermined transform includes: Replacement or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
  • the method before selecting the T bits from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence, the method further includes: forming the bit sequence of the polarization code into a first bit sequence matrix; and the first bit sequence Performing a second predetermined transform on the matrix to obtain a second bit sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted includes: T bits are selected in the two-bit sequence matrix as the bit sequence to be transmitted.
  • the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed.
  • the multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
  • the method may further include: storing the bit sequence in the second bit sequence matrix in the cache, and selecting from the cache. T bits are used as a sequence of bits to be transmitted.
  • cache may be represented by other physical entities or logically, but is not limited thereto.
  • the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto.
  • the first index matrix is a two-dimensional matrix, and the first predetermined transform may be used. It is expressed as follows: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
  • the second index matrix is M re
  • M re is a matrix of R re rows C re columns
  • the first index matrix is M or M or is
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • R re and C re have one of the following characteristics: in the case where R re is constant, C re is a minimum value satisfying R re ⁇ C re ⁇ N; in the case where C re is constant, R re is a minimum value satisfying R re ⁇ C re ⁇ N.
  • the first index matrix is subjected to the first predetermined transformation to obtain the second index matrix, including at least one of the following: the ith column of M re is obtained by column permutation of the ⁇ 1 (i) column of M or , 0 ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; j-M behavior of Re M or of ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j and [pi] 2 (j) are positive integers.
  • Polarization code encoding process due to M or M re the same permutation pattern for each row, if the fixed number of columns and M or M re when polarization mother code length code (mother code length) changes, only It is necessary to change the number of rows of Mor and M re ; or, the permutation mode of each column of Mor to M re is the same, if the number of rows of Mor and M re is fixed, when the mother code length of the polarization code (mother code) When changing length, you only need to change the number of columns of M or M re .
  • the hardware of the input bit sequence to the encoder input position mapping is for the maximum mother code length N max , it is also applicable to the case where the mother code length is less than N max , thereby realizing hardware multiplexing. .
  • f(r) includes at least one of the following:
  • n1 iterations are updated, and the function value of each element is obtained.
  • the first iteration calculation formula is among them, Is the log likelihood ratio mean at r; for example: Approximate The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
  • the second iteration calculation formula is Is the mutual information at r; wherein, 1 ⁇ m2 ⁇ n1, 1 ⁇ m3 ⁇ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1;
  • the iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
  • the fourth iteration calculation formula is among them, Is the mutual information at s; wherein, 1 ⁇ m5 ⁇ n2, 1 ⁇ m6 ⁇ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
  • the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto.
  • the first bit sequence matrix is a two-dimensional matrix, for example, the second pre-
  • the definition transformation is: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • C vb is the minimum value satisfying R vb ⁇ C vb ⁇ N; or in the case of constant C vb, R vb is satisfied R vb ⁇ C vb ⁇ The minimum value of N.
  • the first bit sequence to a second predetermined matrix transformation matrix to obtain a second bit sequence comprising at least one of: the first g M vb ⁇ M og ranked in 3 (g) after column permutation column to give wherein, 0 ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; M vb of the h behavior of ⁇ M og 4 (h) through the line row permutation obtained, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ (h) 4 ⁇ R vb -1, R vb ⁇ C vb ⁇ N, Both h and ⁇ 4 (h) are positive integers.
  • selecting a suitable bit from the encoded bit sequence to form a bit sequence to be transmitted is a process of rate matching.
  • the permutation mode of each line of M og to M vb is the same, if the number of columns of M og and M vb is fixed, when the mother code length of the polarization code changes, only It is necessary to change the number of rows of M og and M vb ; or, the permutation mode of each column of M og to M vb is the same, if the number of rows of M og and M vb is fixed, when the mother code length of the polarization code (mother code length) When changing, only the number of columns of M og and M vb needs to be changed.
  • the hardware of the input bit sequence to the polarization code encoder input position mapping is for the maximum mother code length N max , it is also applicable to the case where the mother code length is less than N max , thereby realizing Hardware reuse.
  • the sixth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m7 ⁇ n3, 1 ⁇ m8 ⁇ n3, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
  • the seventh iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to ⁇ to Then at Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
  • the eighth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m10 ⁇ n4, 1 ⁇ m11 ⁇ n4, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
  • obtaining the M_index by the second index matrix includes: selecting a predetermined number of indexes from the M re by row or column or diagonally, and taking a predetermined number of indexes as M_index.
  • selecting a predetermined number of indexes from the M re by the column includes: selecting K p indexes from the p- th column in the M re , wherein, p is an integer, and 1 ⁇ p ⁇ C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein q is an integer, and 1 ⁇ q ⁇ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K ⁇ indexes from the diagonal line of the ⁇ th line in M re , wherein ⁇ is an integer, and -min(R re , C re )+1 ⁇ max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
  • selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein 1 ⁇ ic1 ⁇ C 1 , 1 ⁇ C 1 ⁇ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein C 2 ⁇ ic2 ⁇ C 3 , 1 ⁇ C 2 ⁇ C 3 ⁇ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which C 4 ⁇ ic3 ⁇ C re, 1 ⁇ C 4 ⁇ C re, ic3 and C 4 are integers.
  • At least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein 1 ⁇ ir1 ⁇ R 1 , 1 ⁇ R 1 ⁇ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein R 2 ⁇ ir2 ⁇ R 3 , 1 ⁇ R 2 ⁇ R 3 ⁇ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which 1 ⁇ R 4 ⁇ R re , and ir3 and R 4 are integers.
  • selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where -min(R re , C re )+1 ⁇ D 1 ⁇ max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which -min(R re , C re )+1 ⁇ D 2 ⁇ D 3 ⁇ max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonal
  • M is a square matrix, that is, the number of columns cc is equal to the number of rows rr, if the diagonal of the 0th line is the main diagonal, it is parallel to the main diagonal.
  • Upward is the first, second, ..., rr-1 diagonal lines, parallel to the main diagonal, followed by the -1, -2, ..., -rr+1 diagonal lines;
  • the diagonal of the 0th line is the diagonal of the sub-diagonal line, which is parallel to the sub-diagonal line, and the first, second, ..., rr-1 diagonal lines are in the order of the diagonal, parallel to the sub-diagonal line, and sequentially Is the -1, -2, ..., -rr+1 diagonal;
  • the matrix M is not a square matrix, the number of columns cc is greater than the number of rows rr, and the matrix
  • the diagonal of the 0th line is formed by the element a 1, cc and the elements a rr, cc-rr+1 , it is parallel to the diagonal of the 0th line, and the first is the first and the second.
  • the matrix M is not a square matrix, the number of rows rr is greater than the number of columns cc, in a matrix.
  • the diagonal of the 0th line is formed by the element a rr, 1 and the element a rr-cc+1, cc , it is parallel, and the first is the first, 2, ..., Rr-1 diagonal lines, followed by the -1, -2, ..., -cc+1 diagonal lines; if the 0th diagonal is the element a rr-cc+1, 1 Connected with the elements a rr, cc , parallel to it, up to the first, 2, ..., rr-1 diagonal lines, followed by the first -1, -2, ..., -cc+ 1 diagonal.
  • the process of selecting a predetermined number of indexes by row or column or diagonally from M re skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
  • the encoded bit sequence is ⁇ x 0 , x 1 , x 2 , . . . , x 15 ⁇
  • the bit sequence to be transmitted is ⁇ x 6 , x 7 , . . . , x 15 ⁇
  • the bit is not transmitted.
  • the index corresponding to the sequence is ⁇ 0, 1, 2, .., 5 ⁇
  • the index ⁇ 0, 1, 2, .., 5 ⁇ should be skipped.
  • selecting T bits from the second bit sequence matrix as the to-be-transmitted bit sequence includes: sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence. .
  • sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence includes starting from the starting position t in the second bit sequence matrix, according to the row. Or sequentially selecting T bits from the second bit sequence matrix in a column or diagonal manner, wherein when the first bit or the last bit in the second bit sequence matrix is selected, jumping to the second bit sequence matrix The last bit or the first bit in the continuation is selected, 1 ⁇ t ⁇ R vb ⁇ C vb .
  • T bits are sequentially selected as a to-be-transmitted bit sequence by row or column or diagonally, including: when T is less than or equal to the length N of the bit sequence after the polarization code is encoded.
  • the first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in columns; when T is less than or equal to the length N of the bit sequence after the polarization code is encoded, the rows are sequentially Selecting 1st to Tth bits or N-T+1th to Nth bits in the second bit sequence matrix; when T is less than or equal to the length N of the bit sequence after the polarization code encoding, the first step is selected in a diagonal manner 1st to Tth bits or N-T+1 to N bits in the two-bit sequence matrix; when T is greater than the length N of the bit sequence after polarization code encoding, the tth bit from the second bit sequence matrix Initially, T bits are sequentially selected by row or column or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit is skipped. Continue to select, where 1 ⁇ t ⁇ R vb ⁇ C vb ; N is a positive integer.
  • the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein 1 ⁇ E 1 ⁇ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein 1 ⁇ E 2 ⁇ E 3 ⁇ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein 1 ⁇ E 4 ⁇ C vb , ie3 and E 4 are integers.
  • selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein 1 ⁇ F 1 ⁇ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein 1 ⁇ F 2 ⁇ F 3 ⁇ R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein 1 ⁇ F 4 ⁇ R vb , if3 and F 4 are integers.
  • T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where -min(R vb , C vb ) +1 ⁇ G 1 ⁇ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which -min(R vb , C vb )+1 ⁇ G 2 ⁇ G 3 ⁇ max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally
  • Sending a bit sequence if the first 9 bits are sequentially arranged in columns to form a bit sequence to be transmitted, it is selected to be ⁇ y 0 , y 4 , y 8 , y 12 , y 1 , y 5 , y 9 , y 13 , y 3 ⁇ Send a bit sequence; if the first 9 bits are selected in a diagonal direction to form a bit sequence to be transmitted, it is composed of ⁇ y 0 , y 1 , y 4 , y 2 , y 5 , y 8 , y 3 , y 6 , y 9 ⁇
  • the bit sequence to be transmitted if the 9 bits are sequentially selected in rows to form the bit sequence to be transmitted, it is composed of ⁇ y 7 , y 8 , y 9 , y 10 , y 11 , y 12 , y 13 , y 14 , y 15 ⁇
  • the bit sequence to be transmitted if the 9 bits are sequential
  • the sequence of bits to be transmitted is composed.
  • the order is selected, if the last bit y 15 of M vb is selected, the jump to the first bit y 0 of M vb continues to be selected; when the reverse order is selected, if the first bit y 0 of M vb is selected, then jump to The last bit y 15 of M vb continues to be selected.
  • execution subject of the foregoing steps may be a base station or a terminal, but is not limited thereto.
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present application which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
  • the optical disc includes a number of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present application.
  • a sequence determining device is further provided, which is used to implement the above-mentioned embodiments and preferred embodiments, and has not been described again.
  • the term “module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 3 is a structural block diagram of a sequence determining apparatus according to an embodiment of the present application. As shown in FIG. 3, the apparatus includes:
  • the rearrangement module 32 is configured to map the first bit sequence of length K bits to the designated position according to the M_index to obtain a second bit sequence;
  • the encoding module 34 is connected to the rearrangement module 32, and configured to perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code encoding;
  • the selecting module 36 is connected to the encoding module 34, and configured to select T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein K and T are positive integers, K ⁇ T.
  • the first bit sequence of length K bits is rearranged according to the index in the index sequence M_index to obtain a second bit sequence.
  • the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding.
  • the T bit is selected from the bit sequence after the polarization code encoding as the bit sequence to be transmitted, that is, the present application provides a method for determining the bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence in the 5G New RAT. Identify the problem with the method.
  • the foregoing apparatus may further include: a first transform module, connected to the rearrangement module 32, configured to: pass the first index matrix to obtain a second index matrix by using a first predetermined transform; and pass the second index The matrix obtains M_index; wherein the first predetermined transform includes: row permutation or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
  • the apparatus further includes: a second transform module, coupled to the encoding module 34, configured to form a bit sequence of the first bit sequence matrix by encoding the bit code; and performing the first bit sequence matrix
  • the second predetermined transform obtains a second bit sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted. That is, the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed.
  • the multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
  • the foregoing apparatus may further include: a storage module, connected to the first transform module, configured to store a second bit sequence matrix.
  • storage module may be cached, or other memory such as memory, or other logic exists, but is not limited thereto.
  • the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto.
  • the first index matrix is a two-dimensional matrix, and the transformation mode of the same dimension is used. The same can be expressed as: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
  • the second index matrix is M re
  • M re is a matrix of R re rows C re columns
  • the first index matrix is M or M or is
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • C re is the minimum value satisfying R re ⁇ C re ⁇ N; or in the case of constant C re, R re to meet R re ⁇ C re ⁇ The minimum value of N.
  • the first transform module is further configured to obtain the second index matrix by at least one of the following: the ith column of M re is obtained by column permutation of the ⁇ 1 (i) column of M or , where, ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; j-M or the behavior of M re of ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j and ⁇ 2 ( j) are positive integers.
  • f(r) includes at least one of the following:
  • n1 iterations are updated, and the function value of each element is obtained.
  • the first iteration calculation formula is among them, Is the log likelihood ratio mean at r; for example: Approximate The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
  • the second iteration calculation formula is Is the mutual information at r; wherein, 1 ⁇ m2 ⁇ n1, 1 ⁇ m3 ⁇ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1;
  • the iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
  • the fourth iteration calculation formula is among them, Is the mutual information at s; wherein, 1 ⁇ m5 ⁇ n2, 1 ⁇ m6 ⁇ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
  • the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto, and the first bit sequence matrix is taken as a two-dimensional matrix, for example, the same dimension
  • the same transformation mode can be expressed as follows: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • C vb is the minimum value satisfying R vb ⁇ C vb ⁇ N; or in the case of constant C vb, R vb is satisfied R vb ⁇ C vb ⁇ The minimum value of N.
  • the second conversion module is further configured to obtain a second bit sequence by at least one of the following matrix: M vb first ranked ⁇ M og g of 3 (g) after column permutation obtained column, wherein 0 ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; h behavior of the M og M vb of ⁇ 4 (h) obtained after the row permutation of the rows, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ 4 (h) ⁇ R vb -1, R vb ⁇ C vb ⁇ N, h and ⁇ 4 (h) are positive integers.
  • the sixth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m7 ⁇ n3, 1 ⁇ m8 ⁇ n3, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
  • the seventh iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to ⁇ to Then at Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
  • the eighth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m10 ⁇ n4, 1 ⁇ m11 ⁇ n4, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
  • the first transform module is further configured to select a predetermined number of indexes from the M re by row or column or diagonally, and use a predetermined number of indexes as M_index.
  • selecting a predetermined number of columns from M re index comprises: selecting from the p-th column of M re index K p, wherein p is an integer, and 1 ⁇ p ⁇ C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein q is an integer, and 1 ⁇ q ⁇ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K ⁇ indexes from the diagonal line of the ⁇ th line in M re , wherein ⁇ is an integer, and -min(R re , C re )+1 ⁇ max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
  • selecting a predetermined number of indexes from the column by M re includes at least one of the following: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein 1 ⁇ ic1 ⁇ C 1 , 1 ⁇ C 1 ⁇ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein C 2 ⁇ ic2 ⁇ C 3 , 1 ⁇ C 2 ⁇ C 3 ⁇ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which C 4 ⁇ ic3 ⁇ C re, 1 ⁇ C 4 ⁇ C re, ic3 and C 4 are integers.
  • At least one of the following number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are selected from the first, second, ..., R 1 rows, wherein 1 ⁇ ir1 ⁇ R 1 , 1 ⁇ R 1 ⁇ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein R 2 ⁇ ir2 ⁇ R 3 , 1 ⁇ R 2 ⁇ R 3 ⁇ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which 1 ⁇ R 4 ⁇ R re , and ir3 and R 4 are integers.
  • selecting a predetermined number of indexes from the M re diagonally includes at least one of the following: from the M re , from the -min(R re , C re )+1, -min(R re , C Re )+2,...,D 1 diagonally select K id1 index, where -min(R re , C re )+1 ⁇ D 1 ⁇ max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which -min(R re , C re )+1 ⁇ D 2 ⁇ D 3 ⁇ max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonally select K id3 index
  • the process of selecting a predetermined number of indexes by row or column or diagonally from M re skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
  • the foregoing selection module 36 may be further configured to sequentially select T bits as a to-be-transmitted bit sequence from the second bit sequence matrix by row or column or diagonally.
  • the selection module 36 may be further configured to sequentially select T bits from the second bit sequence matrix in a row or column or diagonal manner starting from a starting position t in the second bit sequence matrix. Wherein, when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit that jumps to the second bit sequence matrix continues to be selected, 1 ⁇ t ⁇ R vb ⁇ C Vb .
  • the selection module 36 may be further configured to select the first to T bits or the Nth of the second bit sequence matrix in columns when the T is less than or equal to the length N of the bit sequence after the polarization code is encoded. -T+1 to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 in the second bit sequence matrix are sequentially selected in rows.
  • T bits Up to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 to N in the second bit sequence matrix are sequentially selected in a diagonal manner a bit; when T is greater than the length N of the bit sequence after the polarization code is encoded, starting from the t-th bit in the second bit sequence matrix, T bits are sequentially selected by row or column or diagonally, wherein When the first bit or the last bit in the second bit sequence matrix is fetched, the last bit or the first bit is skipped, wherein 1 ⁇ t ⁇ R vb ⁇ C vb -1; wherein N is A positive integer.
  • the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein 1 ⁇ E 1 ⁇ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein 1 ⁇ E 2 ⁇ E 3 ⁇ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein 1 ⁇ E 4 ⁇ C vb , ie3 and E 4 are integers.
  • selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein 1 ⁇ F 1 ⁇ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein 1 ⁇ F 2 ⁇ F 3 ⁇ R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein 1 ⁇ F 4 ⁇ R vb , if3 and F 4 are integers.
  • T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where -min(R vb , C vb ) +1 ⁇ G 1 ⁇ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which -min(R vb , C vb )+1 ⁇ G 2 ⁇ G 3 ⁇ max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally
  • the foregoing apparatus may be located in the terminal, or may be located in a network side device such as a base station, but is not limited thereto.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination.
  • the forms are located in different processors.
  • Embodiment 3 of the present application provides a device
  • FIG. 4 is a structural block diagram of a device according to Embodiment 3 of the present application. As shown in FIG. 4, the device includes:
  • the processor 42 is configured to map the first bit sequence of length K bits to the specified position according to the M_index to obtain a second bit sequence, and perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code encoding; And selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein, K and T are positive integers, K ⁇ T;
  • the memory 44 is coupled to the processor 42 described above.
  • the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding;
  • the T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
  • the processor 42 may be further configured to: obtain a second index matrix by using a first predetermined transformation by the first index matrix; and obtain an M_index by using the second index matrix; wherein, the first predetermined transformation comprises: Row permutation or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
  • the processor 42 may be further configured to: write a bit sequence encoded by the polarization code into the first bit sequence matrix; perform a second predetermined transform on the first bit sequence matrix to obtain a second bit. a sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted. That is, the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed.
  • the multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
  • the foregoing memory may be configured to store the second bit sequence matrix, and the memory may be a cache or other memory such as memory or other logic, but is not limited thereto.
  • the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto.
  • the first index matrix is a two-dimensional matrix, and the transformation mode of the same dimension is used. The same can be expressed as: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
  • the second index matrix is M re
  • M re is a matrix of R re rows C re columns
  • the first index matrix is M or M or is
  • R re ⁇ C re ⁇ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
  • C re is the minimum value satisfying R re ⁇ C re ⁇ N; or in the case of constant C re, R re to meet R re ⁇ C re ⁇ The minimum value of N.
  • the processor 42 is further configured to obtain the second index matrix by at least one of the following: the ith column of M re is the ⁇ 1 (i) column of the M or the column replacement, wherein 0 ⁇ i ⁇ C re -1,0 ⁇ 1 (i) ⁇ C re -1, R re ⁇ C re ⁇ N, i and ⁇ 1 (i) are positive integers; M or behavior of the j-th of the M re ⁇ 2 (j) rows through row permutation obtained, wherein, 0 ⁇ j ⁇ R re -1,0 ⁇ 2 (j) ⁇ R re -1, R re ⁇ C re ⁇ N, j and ⁇ 2 (j ) are positive integers.
  • f(r) includes at least one of the following:
  • n1 iterations are updated, and the function value of each element is obtained.
  • the first iteration calculation formula is among them, Is the log likelihood ratio mean at r; for example: Approximate The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
  • the second iteration calculation formula is Is the mutual information at r; wherein, 1 ⁇ m2 ⁇ n1, 1 ⁇ m3 ⁇ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1;
  • the iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
  • the fourth iteration calculation formula is among them, Is the mutual information at s; wherein, 1 ⁇ m5 ⁇ n2, 1 ⁇ m6 ⁇ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
  • the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto, and the first bit sequence matrix is taken as a two-dimensional matrix, for example, the same dimension
  • the same transformation mode can be expressed as follows: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
  • the first bit sequence matrix is M og
  • the second bit sequence matrix is M vb
  • M vb is a matrix of R vb rows C vb columns
  • M og is
  • R vb ⁇ C vb ⁇ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
  • C vb is the minimum value satisfying R vb ⁇ C vb ⁇ N; or in the case of constant C vb, R vb is satisfied R vb ⁇ C vb ⁇ The minimum value of N.
  • the processor 42 is also configured to obtain at least one second bit sequence matrix: g M vb of the section as M og ⁇ 3 (g) after column permutation obtained column, wherein 0 ⁇ g ⁇ C vb -1,0 ⁇ 3 (g) ⁇ C vb -1, R vb ⁇ C vb ⁇ N, g , and ⁇ 3 (g) are positive integers; h-M vb behavior of the M og of ⁇ 4 (h) through the line row permutation obtained, wherein, 0 ⁇ h ⁇ R vb -1,0 ⁇ 4 (h) ⁇ R vb -1, R vb ⁇ C vb ⁇ N, h and ⁇ 4 ( h) are positive integers.
  • the sixth iteration calculation formula is It is mutual information at r; wherein, 1 ⁇ m7 ⁇ n3, 1 ⁇ m8 ⁇ n3, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
  • the seventh iteration calculation formula is among them, Is the log likelihood ratio mean at r; initializes the function value corresponding to ⁇ to Then at Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
  • the eighth iteration calculation formula is It is a mutual information at ⁇ ; wherein, 1 ⁇ m10 ⁇ n4, 1 ⁇ m11 ⁇ n4, ⁇ 1, ⁇ 2, 2 ⁇ and 2 ⁇ -1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
  • the first transform module is further configured to select a predetermined number of indexes from the M re by row or column or diagonally, and use a predetermined number of indexes as M_index.
  • selecting a predetermined number of columns from M re index comprises: selecting from the p-th column of M re index K p, wherein p is an integer, and 1 ⁇ p ⁇ C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein q is an integer, and 1 ⁇ q ⁇ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K ⁇ indexes from the diagonal line of the ⁇ th line in M re , wherein ⁇ is an integer, and -min(R re , C re )+1 ⁇ max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
  • selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein 1 ⁇ ic1 ⁇ C 1 , 1 ⁇ C 1 ⁇ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein C 2 ⁇ ic2 ⁇ C 3 , 1 ⁇ C 2 ⁇ C 3 ⁇ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which C 4 ⁇ ic3 ⁇ C re, 1 ⁇ C 4 ⁇ C re, ic3 and C 4 are integers.
  • At least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein ⁇ ir1 ⁇ R 1 , 1 ⁇ R 1 ⁇ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein R 2 ⁇ ir2 ⁇ R 3 , 1 ⁇ R 2 ⁇ R 3 ⁇ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which 1 ⁇ R 4 ⁇ R re , and ir3 and R 4 are integers.
  • selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where -min(R re , C re )+1 ⁇ D 1 ⁇ max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which -min(R re , C re )+1 ⁇ D 2 ⁇ D 3 ⁇ max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonal
  • the process of selecting a predetermined number of indexes by row or column or diagonally from M re skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
  • processor 42 may be further configured to sequentially select T bits as a to-be-transmitted bit sequence in a row or column or diagonal manner from the second bit sequence matrix.
  • the processor 42 may be further configured to sequentially select T bits from the second bit sequence matrix in a row or column or diagonal manner starting from a starting position t in the second bit sequence matrix. Wherein, when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit that jumps to the second bit sequence matrix continues to be selected, 1 ⁇ t ⁇ R vb ⁇ C Vb .
  • the processor 42 may be configured to select the first to T bits or the Nth of the second bit sequence matrix in columns when the T is less than or equal to the length N of the bit sequence after the polarization code encoding. -T+1 to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 in the second bit sequence matrix are sequentially selected in rows.
  • T bits Up to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 to N in the second bit sequence matrix are sequentially selected in a diagonal manner a bit; when T is greater than the length N of the bit sequence after the polarization code is encoded, starting from the t-th bit in the second bit sequence matrix, T bits are sequentially selected by row or column or diagonally, wherein When the first bit or the last bit in the second bit sequence matrix is taken, the last bit or the first bit is skipped, where 1 ⁇ t ⁇ R vb ⁇ C vb ; where N is a positive integer .
  • the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein 1 ⁇ E 1 ⁇ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein 1 ⁇ E 2 ⁇ E 3 ⁇ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein 1 ⁇ E 4 ⁇ C vb , ie3 and E 4 are integers.
  • selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein ⁇ F 1 ⁇ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein 1 ⁇ F 2 ⁇ F 3 ⁇ R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein 1 ⁇ F 4 ⁇ R vb , if3 and F 4 are integers.
  • T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where -min(R vb , C vb ) +1 ⁇ G 1 ⁇ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which -min(R vb , C vb )+1 ⁇ G 2 ⁇ G 3 ⁇ max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally
  • the foregoing device may be a terminal, or may be a network side device such as a base station, but is not limited thereto.
  • the embodiment of the present application further provides a storage medium including a stored program, wherein the program runs to perform the method described in any of the above.
  • the storage medium may be set to store program code for executing the steps of the method in Embodiment 1.
  • the storage medium may include, but is not limited to, a USB flash drive, a Read-Only Memory (ROM), and a Random Access Memory (Random Access Memory).
  • ROM Read-Only Memory
  • Random Access Memory Random Access Memory
  • Embodiments of the present application also provide a processor configured to execute a program, wherein the program executes the steps of any of the above methods when executed.
  • the program is configured to perform the steps of the method in Embodiment 1.
  • the index of M re is 0, the index of the index matrix M or is the column of index 1 of
  • the transmission bit sequence is selected from the index corresponding to the output of the encoder;
  • the sequence is ⁇ y 8 , y 24 , y 40 , y 56 , y 72 , y 88 , y 104 , y 120 , . . . , y 15 , y 31 , y 47 , y 63 , y 79 , y 95 , y 111 , y 127 ⁇ .
  • the jump to the first bit y 0 of the bit sequence matrix M vb continues to be selected, and the bit sequence to be transmitted is obtained as ⁇ y 0 , y 1 , y 2 ,... , y 127 , y 0 , y 1 , y 2 ⁇ .
  • the jump to the last bit y 127 of the bit sequence matrix M vb continues to be selected, and the bit sequence to be transmitted is obtained as ⁇ y 0 , y 1 , y 2 , ..., y 127 , y 127 , y 126 , y 125 ⁇ .
  • the polarization code encoding of 128 is different from that of the preferred embodiment 1.
  • the rate matching uses other methods, and the specific operation steps are not described again.
  • the polarization code encoding of 128 is different from that of the preferred embodiment 2.
  • the rate matching uses other methods, and the specific operation steps are not described again.
  • the polarization code encoding of 128 is different from that of the preferred embodiment 3.
  • the rate matching uses other methods, and the specific operation steps are not described again.
  • the polarization code encoding of 128 is different from that of the preferred embodiment 4.
  • the rate matching uses other methods, and the specific operation steps are not described again.
  • modules or steps of the present application can be implemented by a general computing device, which can be concentrated on a single computing device or distributed in a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the application is not limited to any particular combination of hardware and software.
  • the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding;
  • the T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The present application provides a sequence determining method and apparatus, a device, and a storage medium. The sequence determining method comprises: mapping, according to M index, a first bit sequence having a length of K bits to a specified position to obtain a second bit sequence; encoding the second bit sequence by using a Polar code to obtain a bit sequence encoded by using the Polar code; and selecting T bits from the bit sequence encoded by using the Polar code as a bit sequence to be transmitted, K and T being positive integers, and K≤T.

Description

序列确定方法及装置、设备、存储介质Sequence determination method and device, device, storage medium
相关申请的交叉引用Cross-reference to related applications
本申请基于申请号为201710314013.X、申请日为2017年5月5日的中国专利申请、及申请号为201710737955.9、申请日为2017年8月24日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。This application is based on the Chinese patent application with the application number 201710314013.X, the application date is May 5, 2017, and the Chinese patent application with the application number of 201710737955.9 and the application date is August 24, 2017, and the Chinese patent is required. Priority of the application, the entire contents of which is hereby incorporated by reference.
技术领域Technical field
本申请涉及通信领域，具体而言，涉及一种序列确定方法及装置、设备、存储介质。The present application relates to the field of communications, and in particular, to a sequence determining method and apparatus, device, and storage medium.
背景技术Background technique
由于信道噪声的存在，信道编码服务作为移动通信系统的独立部分，它保证着信息传递的可靠性、准确性和有效性。Due to the existence of channel noise, the channel coding service is a separate part of the mobile communication system, which ensures the reliability, accuracy and effectiveness of information transmission.
极化码编码是一种被严格证明的可达信道容量的构造性编码方式，而且能满足5G New RAT中对通信吞吐量(Throughput)和时延(Latency)的要求。极化码编码后的码字可表示为x＝u·G N。 Polarization code coding is a rigorously proven constructive coding method for reachable channel capacity, and it can meet the requirements of communication throughput (Throughput) and Latency in 5G New RAT. The codeword encoded by the polarization code can be expressed as x=u·G N .
其中，u＝(u1,…,uN)是由信息比特、已知比特和校验比特构成，
Figure PCTCN2018085645-appb-000001
Figure PCTCN2018085645-appb-000002
表示对矩阵F 2进行n次克罗内克积操作，且
Figure PCTCN2018085645-appb-000003
Where u=(u1,...,uN) is composed of information bits, known bits and check bits.
Figure PCTCN2018085645-appb-000001
Figure PCTCN2018085645-appb-000002
Representing n times Kronecker product operations on matrix F 2 , and
Figure PCTCN2018085645-appb-000003
由于极化码的极化特性，每个输入比特可靠性不同，即不同位置的输入比特误比特率(BER)不同，故在编码时将信息比特和校验比特排列到可靠度较高的位置(即，BER较小的位置)，将已知比特排列到可靠度较低的位置能有效减小误块率(BLER)，提高译码性能。Due to the polarization characteristics of the polarization code, the reliability of each input bit is different, that is, the bit error rate (BER) of the input bits at different positions is different, so the information bits and the check bits are arranged at a higher reliability position during encoding. (ie, a position where the BER is small), arranging the known bits to a position with lower reliability can effectively reduce the block error rate (BLER) and improve the decoding performance.
在现有技术中，不同极化码母码长度(mother code length)下，实现将信息比特、校验比特和已知比特重排、速率匹配均需要通过不同的硬件实现，并且实现复杂。In the prior art, under different mother code lengths, information bits, check bits, and known bit rearrangements and rate matching need to be implemented by different hardwares, and the implementation is complicated.
针对相关技术中的上述技术问题，目前尚未提出有效的解决方案。In view of the above technical problems in the related art, an effective solution has not yet been proposed.
发明内容Summary of the invention
本申请实施例提供了一种序列确定方法及装置、设备、存储介质，以至少解决相关技术中5G New RAT中没有相应的序列确定方法的问题。The embodiment of the present application provides a sequence determining method, apparatus, device, and storage medium to solve at least the problem that there is no corresponding sequence determining method in the 5G New RAT in the related art.
根据本申请的一个实施例，提供了一种序列确定方法，包括：将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将所述第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T。According to an embodiment of the present application, a sequence determining method is provided, including: mapping a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; performing the second bit sequence Polarization code encoding, obtaining a bit sequence after polarization code encoding; selecting T bits from the bit sequence after polarization code encoding as a bit sequence to be transmitted; wherein K and T are positive integers, K≤T.
本申请一实施方式中，在将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列之前，所述方法还包括：将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。In an embodiment of the present application, before the first bit sequence of length K bits is mapped to the specified position according to the M_index to obtain the second bit sequence, the method further includes: obtaining the first index matrix by using the first predetermined transform. a second index matrix; obtaining M_index by the second index matrix; wherein the first predetermined transform comprises: row permutation or column permutation.
本申请一实施方式中，在从极化码编码后比特序列中选取T个比特作为待发送比特序列之前，方法还包括：将极化码编码后比特序列组成第一比特序列矩阵；将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，第二预定变换包括：行置换或者列置换；从极化码编码后比特序列中选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中选取T个比特作为待发送比特序列。In an implementation manner of the present application, before selecting a T bit from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence, the method further includes: forming the bit sequence into a first bit sequence matrix after encoding the polarization code; The bit sequence matrix performs a second predetermined transform to obtain a second bit sequence matrix; wherein the second predetermined transform includes: row permutation or column permutation; and selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted includes: T bits are selected from the second bit sequence matrix as the bit sequence to be transmitted.
本申请一实施方式中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 In an embodiment of the present application, the second index matrix is M re , and M re is a matrix of R re rows C re columns, and the first index matrix is M or M or
Figure PCTCN2018085645-appb-000004
或者，
Figure PCTCN2018085645-appb-000004
or,
Figure PCTCN2018085645-appb-000005
Figure PCTCN2018085645-appb-000005
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R re不变的情况下，C re为满足R re×C re≥N的最小值；或者，在C re不变的情况下，R re为满足R re×C re≥N的最小值。 In an embodiment of the present application, when R re is constant, C re is a minimum value satisfying R re ×C re ≥N; or, in the case where C re is constant, R re is satisfying R re ×C Re ≥ the minimum value of N.
本申请一实施方式中，将第一索引矩阵经过第一预定变换得到第二索引矩阵包括以下至少之一：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 In an embodiment of the present application, the first index matrix is subjected to the first predetermined transformation to obtain the second index matrix, including at least one of the following: the ith column of M re is the π 1 (i) column of the M or the column replacement. wherein, 0≤i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; j M re of the M or behavior of π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j And π 2 (j) are both positive integers.
本申请一实施方式中，π 1(i)通过以下至少之一方式获取：π 1(i)＝BRO(i)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数i转换为第一二进制数(B n1-1,B n1-2,…,B 0)，将第一二进制数反序排列得到第二二进制数(B 0,B 1,…,B n1-1)，再将第二二进制数转换成十进制数得到π 1(i)，其中，n1＝log 2(C re)，0≤i≤C re-1；π 1(i)＝{S1,S2,S3}，其中，S1＝{0,1,…,i1-1}，S2＝{i2,i3,i2+1,i3+1,…,i4,i5}，S3为{0,1,…,C re-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C re/8≤i1≤i2≤C re/3,i2≤i4≤i3≤2C re/3,i3≤i5≤C re-1，其中，i1、i2、i3、i4和i5均为正整数，且S1，S2与S3任意两者的交集为空集；π 1(i)＝{I}，其中，序列{I}由M or的列索引r按照函数f(r)计算得到的数值结果升序或降序顺序 排列得到，0≤r≤C re-1，f(r)具有单调性。 In an embodiment of the present application, π 1 (i) is obtained by at least one of the following: π 1 (i)=BRO(i), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal a first number of i is converted into binary number (B n1-1, B n1-2, ... , B 0), the reverse order of the first binary number to obtain a second binary number (B 0, B 1 ,...,B n1-1 ), then convert the second binary number into a decimal number to get π 1 (i), where n1=log 2 (C re ), 0≤i≤C re -1;π 1 (i) = {S1, S2, S3}, where S1 = {0, 1, ..., i1-1}, S2 = {i2, i3, i2+1, i3+1, ..., i4, i5}, S3 is a set of elements other than the element included in S1 and the element included in S2 in {0, 1, ..., C re -1}, where C re /8 ≤ i1 ≤ i2 ≤ C re /3, I2 ≤ i4 ≤ i3 ≤ 2C re /3, i3 ≤ i5 ≤ C re -1, wherein i1, i2, i3, i4, and i5 are all positive integers, and the intersection of any of S1, S2, and S3 is an empty set ; π 1 (i)={I}, where the sequence {I} is arranged by the column index r of the M or the numerical result calculated by the function f(r) in ascending or descending order, 0≤r≤C re -1 , f(r) is monotonic.
本申请一实施方式中，f(r)包括以下至少之一：
Figure PCTCN2018085645-appb-000006
(B n1-1,B n1-2,…,B 0)为索引r的二进制表示，0≤m1≤n1-1，n1＝log 2(C re)，k为正整数；将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000007
在
Figure PCTCN2018085645-appb-000008
的基础上按照第一迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000009
其中,第一迭代计算公式为
Figure PCTCN2018085645-appb-000010
其中，
Figure PCTCN2018085645-appb-000011
为r处的对数似然比均值；将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000012
然后在
Figure PCTCN2018085645-appb-000013
的基础上按照第二迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000014
其中，第二迭代计算公式为
Figure PCTCN2018085645-appb-000015
为r处的互信息；其中，1≤m2≤n1，1≤m3≤n1，r1,r2,2r和2r-1均为大于或者等于0且小于或者等于C re-1的整数。 In an embodiment of the present application, f(r) includes at least one of the following:
Figure PCTCN2018085645-appb-000006
(B n1-1, B n1-2, ... , B 0) is the binary representation of the index r, 0≤m1≤n1-1, n1 = log 2 ( C re), k is a positive integer; r corresponding to the function The value is initialized to
Figure PCTCN2018085645-appb-000007
in
Figure PCTCN2018085645-appb-000008
Based on the first iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000009
Wherein, the first iteration calculation formula is
Figure PCTCN2018085645-appb-000010
among them,
Figure PCTCN2018085645-appb-000011
Is the log likelihood ratio mean at r; initializes the function value corresponding to r to
Figure PCTCN2018085645-appb-000012
Then at
Figure PCTCN2018085645-appb-000013
Based on the second iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000014
Wherein, the second iteration calculation formula is
Figure PCTCN2018085645-appb-000015
It is mutual information at r; wherein, 1 ≤ m2 ≤ n1, 1 ≤ m3 ≤ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1.
本申请一实施方式中，π 2(j)通过以下至少之一方式获取：π 2(j)＝BRO(j)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数j转换为第三二进制数(B n2-1,B n2-2,…,B 0)，将第三二进制数反序排列得到第四二进制数(B 0,B 1,…,B n2-1)，再将第四二进制数转换成十进制数得到π 2(j)，其中，n2＝log 2(R re)，0≤j≤R re-1；π 2(j)＝{S4,S5,S6}，其中，S4＝{0,1,…,j1-1}，S5＝{j2,j3,j2+1,j3+1,…,j4,j5}，S6为{0,1,…,R re-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R re/8≤j1≤j2≤R re/3,j2≤j4≤j3≤2R re/3,j3≤j5≤R re-1，其中，j1、j2、j3、j4和j5均为正整数，且S4，S5与S6任意两者的交集为空集；π 2(J)＝{J}，其中，序列{J}中由M or的行索引s按照函数f(s)计算得到的数值结果升序或降序顺序排列得到，0≤s≤R re-1，f(s)具有单调性。 In an embodiment of the present application, π 2 (j) is obtained by at least one of the following: π 2 (j)=BRO(j), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal system into a third number of j binary number (B n2-1, B n2-2, ... , B 0), the third binary number in reverse order to obtain a fourth binary number (B 0, B 1 ,...,B n2-1 ), and then convert the fourth binary number into a decimal number to obtain π 2 (j), where n2=log 2 (R re ), 0≤j≤R re -1; π 2 (j)={S4, S5, S6}, where S4={0,1,...,j1-1}, S5={j2,j3,j2+1,j3+1,...,j4,j5}, S6 is a set of {0, 1, ..., R re -1} other than the element included in S4 and the element included in S5, where R re /8≤j1≤j2≤R re /3, J2 ≤ j4 ≤ j3 ≤ 2R re /3, j3 ≤ j5 ≤ R re -1, wherein j1, j2, j3, j4 and j5 are positive integers, and the intersection of any of S4, S5 and S6 is an empty set ; π 2 (J) = { J}, where the sequence {J} M or row by s index calculated according to the function f (s) in ascending or descending order numerical results obtained are arranged to give, 0≤s≤R re - 1, f (s) has monotonicity.
本申请一实施方式中，f(s)包括以下至少之一：
Figure PCTCN2018085645-appb-000016
(B n2-1,B n2-2,…,B 0)为索引s的二进制表示，0≤m4≤n2-1，n2＝log 2(R re)，k为正整数；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000017
在
Figure PCTCN2018085645-appb-000018
的基础上按照第三迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000019
其中,第三迭代计算公式为
Figure PCTCN2018085645-appb-000020
其中，
Figure PCTCN2018085645-appb-000021
为s处的对数似然比均值；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000022
然后在
Figure PCTCN2018085645-appb-000023
的基础上按照第四迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000024
其中，第四迭代计算公式为
Figure PCTCN2018085645-appb-000025
其中，
Figure PCTCN2018085645-appb-000026
为s处的互信息；其中，1≤m5≤n2，1≤m6≤n2，s1,s2,2s和2s-1均为大于或者等于0且小于或者等于R re-1的整数。 In an embodiment of the present application, f(s) includes at least one of the following:
Figure PCTCN2018085645-appb-000016
(B n2-1, B n2-2, ... , B 0) is the binary representation of the index s, 0≤m4≤n2-1, n2 = log 2 ( R re), k is a positive integer; s function corresponding The value is initialized to
Figure PCTCN2018085645-appb-000017
in
Figure PCTCN2018085645-appb-000018
Based on the third iteration formula, after n2 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000019
Wherein, the third iteration calculation formula is
Figure PCTCN2018085645-appb-000020
among them,
Figure PCTCN2018085645-appb-000021
Is the log likelihood ratio mean at s; initializes the function value corresponding to s to
Figure PCTCN2018085645-appb-000022
Then at
Figure PCTCN2018085645-appb-000023
Based on the fourth iteration formula, n2 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000024
Wherein, the fourth iteration calculation formula is
Figure PCTCN2018085645-appb-000025
among them,
Figure PCTCN2018085645-appb-000026
Is the mutual information at s; wherein, 1 ≤ m5 ≤ n2, 1 ≤ m6 ≤ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
本申请一实施方式中，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 In an embodiment of the present application, the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000027
或者，
Figure PCTCN2018085645-appb-000027
or,
Figure PCTCN2018085645-appb-000028
Figure PCTCN2018085645-appb-000028
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000029
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000029
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R vb不变的情况下，C vb为满足R vb×C vb In an embodiment of the present application, in the case where R vb is constant, C vb satisfies R vb ×C vb
≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N ≥ the minimum value of N; or, in the case where C vb is constant, R vb satisfies R vb × C vb ≥ N
的最小值。The minimum value.
本申请一实施方式中，将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵包括以下至少之一：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 An embodiment of the present application, the first bit sequence of a second predetermined matrix transformation matrix to obtain a second bit sequence comprising at least one of: the first g M vb π M og ranked in 3 (g) after column Column substitution obtained, wherein, 0≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; M vb π h of behavior of the M og 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π (h) 4 ≤R vb -1, R vb × C vb ≥ N, h and π 4 (h) are both positive integers.
本申请一实施方式中，π 3(g)通过以下至少之一方式获取：π 3(g)＝BRO(g)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数g转换为第五二进制数(B n3-1,B n3-2,…,B 0)，将第五二进制数反序排列得到第六二进制数(B 0,B 11,…,B n3-1)，再将第六二进制数转换成十进制数得到π 3(g)，其中，n3＝log 2(C vb)，0≤g≤C vb-1；π 3(g)＝{S1,S2,S3}，其中，S1＝{0,1,…,g1-1}，S2＝{g2,g3,g2+1,g3+1,…,g4,g5}，S3为{0,1,…,C vb-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C vb/8≤g1≤g2≤C vb/3,g2≤g4≤g3≤2C vb/3,g3≤g5≤C vb-1，其中，g1、g2、g3、g4和g5均为正整数，且S1，S2与S3任意两者的交集为空集；π 3(g)＝{G}，其中，序列{G}由M og的列索引α按照函数f(α)计算得到的数值结果升序或降序顺序排列得到，0≤α≤C vb-1，f(α)具有单调性；π 3(g)＝{Q1,Q2,Q3},其中，Q2＝{q1,q2,q1+1,q2+1,…,q3,q4}，其中0≤q1<q3≤(C vb-1)/2,0≤q2<q4≤(C vb-1)/2,q1,q2,q3和q4均为正整数,Q1和Q3为{0,1，…，C vb-1}与Q2差集中的其他元素，且Q1,Q2,Q3任意两者的交集为空集；在nV1个相同位置上π 3(g)与预定义序列V1的元素不同，其中，V1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nV1≤23；在nV2个相同位置上π 3(g)与预定义序列V2的元素不同，其中，V2＝{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}，0≤nV2≤3。 In an embodiment of the present application, π 3 (g) is obtained by at least one of the following: π 3 (g)=BRO(g), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal system The number g is converted into a fifth binary number (B n3-1 , B n3-2 , ..., B 0 ), and the fifth binary number is arranged in reverse order to obtain a sixth binary number (B 0 , B 11 ,...,B n3-1 ), and then convert the sixth binary number into a decimal number to obtain π 3 (g), where n3=log 2 (C vb ), 0≤g≤C vb -1; π 3 (g) = {S1, S2, S3}, where S1 = {0, 1, ..., g1-1}, S2 = {g2, g3, g2+1, g3+1, ..., g4, g5}, S3 is a set of elements other than the element included in S1 and the element included in S2 in {0, 1, ..., C vb -1}, where C vb /8 ≤ g1 ≤ g2 ≤ C vb /3, G2 ≤ g4 ≤ g3 ≤ 2C vb / 3, g3 ≤ g5 ≤ C vb -1, wherein g1, g2, g3, g4 and g5 are positive integers, and the intersection of any of S1, S2 and S3 is an empty set ; π 3 (g)={G}, where the sequence {G} is arranged in ascending or descending order by the numerical result calculated by the function f(α) of the column index α of the M og , 0 ≤ α ≤ C vb -1 , f(α) has monotonicity; π 3 (g) = {Q1, Q 2, Q3}, where Q2={q1,q2,q1+1,q2+1,...,q3,q4}, where 0≤q1<q3≤(C vb -1)/2,0≤q2<q4 ≤ (C vb -1) /2, q1, q2, q3 and q4 are positive integers, Q1 and Q3 are {0, 1, ..., C vb -1} and other elements in the Q2 difference set, and Q1, Q2 , the intersection of any two of Q3 is an empty set; π 3 (g) is different from the element of the predefined sequence V1 at the same position of nV1, where V1={0, 1, 2, 3, 4, 5, 6, 7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31} , 0 ≤ nV1 ≤ 23; π 3 (g) is different from the element of the predefined sequence V2 at the same position of nV2, where V2 = {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},0≤nV2 ≤3.
本申请一实施方式中，f(α)包括以下至少之一：
Figure PCTCN2018085645-appb-000030
(B n3-1,B n3-2,…,B 0)为索引α的二进制表示，0≤m6≤n3-1，n3＝log 2(C vb)，k为正整数；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000031
在
Figure PCTCN2018085645-appb-000032
的基础上按照第五迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000033
其中,第五迭代计算公式为
Figure PCTCN2018085645-appb-000034
其中，
Figure PCTCN2018085645-appb-000035
为r处的对数似然比均值；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000036
然后在
Figure PCTCN2018085645-appb-000037
的基础上按照第六迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000038
其中，第六迭代计算公式为
Figure PCTCN2018085645-appb-000039
为r处的互信息；其中，1≤m7≤n3，1≤m8≤n3，α1,α2,2α和2α-1均为大于或者等于0且小于或者等于C vb-1的整数。 In an embodiment of the present application, f(α) includes at least one of the following:
Figure PCTCN2018085645-appb-000030
(B n3-1 , B n3-2 , ..., B 0 ) is a binary representation of the index α, 0 ≤ m6 ≤ n3-1, n3 = log 2 (C vb ), k is a positive integer; a function corresponding to α The value is initialized to
Figure PCTCN2018085645-appb-000031
in
Figure PCTCN2018085645-appb-000032
Based on the fifth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000033
Among them, the fifth iteration calculation formula is
Figure PCTCN2018085645-appb-000034
among them,
Figure PCTCN2018085645-appb-000035
Is the log likelihood ratio mean at r; initializes the function value corresponding to α to
Figure PCTCN2018085645-appb-000036
Then at
Figure PCTCN2018085645-appb-000037
Based on the sixth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000038
Wherein, the sixth iteration calculation formula is
Figure PCTCN2018085645-appb-000039
It is mutual information at r; wherein, 1 ≤ m7 ≤ n3, 1 ≤ m8 ≤ n3, α1, α2, 2α and 2α-1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
本申请一实施方式中，π 4(h)通过以下至少之一方式获取：π 4(h)＝BRO(h)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数h转换为第七二进制数(B n4-1,B n4-2,…,B 0)，将第七二进制数反序排列得到第八二进制数(B 0,B 1,…,B n4-1)，再将第八二进制数转换成十进制数得到π 4(h)，其中，n4＝log 2(R vb)，0≤h≤R vb-1；π 4(h)＝{S4,S5,S6}，其中，S4＝{0,1,…,h1-1}，S5＝{h2,h3,h2+1,h3+1,…,h4,h5}，S6为{0,1,…,R vb-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R vb/8≤h1≤h2≤R vb/3,h2≤h4≤h3≤2R vb/3,h3≤h5≤R vb-1，其中，h1、h2、h3、h4和h5均为正整数，且S4，S5与S6任意两者的交集为空集；π 4(h)＝{H}，其中，序列{H}中由M og的行索引β按照函数f(β)计算得到的数值结果升序或降序顺序排列得到，0≤β≤R vb-1，f(β)具有单调性；π 4(h)＝ {O1,O2,O3},其中，O2＝{o1,o2,o1+1,o2+1,…,o3,o4}，其中0≤o1<o3≤(R vb-1)/2,0≤o2<o4≤(R vb-1)/2,o1,o2,o3和o4均为正整数,O1和O3为{0,1，…，R vb-1}与O2差集中的其他元素，且O1,O2,O3任意两者的交集为空集；在nVV1个相同位置上π 4(h)与预定义序列VV1的元素不同，其中VV1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nVV1≤23；在nVV2个相同位置上π 4(h)与预定义序列VV2的元素不同，其中VV2＝{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}，0≤nVV2≤3。 In an embodiment of the present application, π 4 (h) is obtained by at least one of the following: π 4 (h)=BRO(h), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal The number h is converted into a seventh binary number (B n4-1 , B n4-2 , ..., B 0 ), and the seventh binary number is arranged in reverse order to obtain an eighth binary number (B 0 , B 1 ,...,B n4-1 ), then convert the eighth binary number into a decimal number to get π 4 (h), where n4=log 2 (R vb ), 0 ≤ h ≤ R vb -1; π 4 (h)={S4, S5, S6}, where S4={0,1,...,h1-1},S5={h2,h3,h2+1,h3+1,...,h4,h5}, S6 is a set of {0, 1, ..., R vb -1} other than the element included in S4 and the element included in S5, wherein R vb /8≤h1≤h2≤R vb /3, H2≤h4≤h3≤2R vb /3, h3≤h5≤R vb -1, where h1, h2, h3, h4 and h5 are positive integers, and the intersection of any of S4, S5 and S6 is an empty set ; π 4 (h) = { H}, wherein {H} numerical result sequence ascending or descending order by row index β M og as a function f (β) calculated to give arrangement, 0≤β≤R vb - 1, f(β) is monotonic; π 4 (h) = {O 1, O2, O3}, where O2={o1,o2,o1+1,o2+1,...,o3,o4}, where 0≤o1<o3≤(R vb -1)/2,0≤o2 <o4 ≤ (R vb -1) /2, o1, o2, o3 and o4 are positive integers, O1 and O3 are {0, 1, ..., R vb -1} and other elements in the O2 difference set, and O1 The intersection of any two of O2 and O3 is an empty set; π 4 (h) is different from the element of the predefined sequence VV1 at the same position of nVV, where VV1={0, 1, 2, 3, 4, 5, 6 , 7, 8, 9, 10, 11, 12, 16, 13, 17, 14, 18, 15, 19, 20, 24, 21, 22, 25, 26, 28, 23, 27, 29, 30, 31 }, 0 ≤ nVV1 ≤ 23; π 4 (h) is different from the elements of the predefined sequence VV2 at two identical positions of nVV, where VV2 = {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},0≤nVV2 ≤3.
本申请一实施方式中，f(β)包括以下至少之一：
Figure PCTCN2018085645-appb-000040
(B n4-1,B n4-2,…,B 0)为索引β的二进制表示，0≤m9≤n4-1，n4＝log 2(R vb)，k为正整数；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000041
在
Figure PCTCN2018085645-appb-000042
的基础上按照第七迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000043
其中,第七迭代计算公式为
Figure PCTCN2018085645-appb-000044
其中，
Figure PCTCN2018085645-appb-000045
为r处的对数似然比均值；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000046
然后在
Figure PCTCN2018085645-appb-000047
的基础上按照第八迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000048
其中，第八迭代计算公式为
Figure PCTCN2018085645-appb-000049
为r处的互信息；其中，1≤m10≤n4，1≤m11≤n4，β1,β2,2β和2β-1均为大于或者等于0且小于或者等于R vb-1的整数。 In an embodiment of the present application, f(β) includes at least one of the following:
Figure PCTCN2018085645-appb-000040
(B n4-1 , B n4-2 , ..., B 0 ) is a binary representation of the index β, 0 ≤ m9 ≤ n4-1, n4 = log 2 (R vb ), k is a positive integer; a function corresponding to β The value is initialized to
Figure PCTCN2018085645-appb-000041
in
Figure PCTCN2018085645-appb-000042
Based on the seventh iteration formula for n4 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000043
Wherein, the seventh iteration calculation formula is
Figure PCTCN2018085645-appb-000044
among them,
Figure PCTCN2018085645-appb-000045
Is the log likelihood ratio mean at r; initializes the function value corresponding to β to
Figure PCTCN2018085645-appb-000046
Then at
Figure PCTCN2018085645-appb-000047
Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000048
Among them, the eighth iteration calculation formula is
Figure PCTCN2018085645-appb-000049
It is mutual information at r; wherein, 1 ≤ m10 ≤ n4, 1 ≤ m11 ≤ n4, β1, β2, 2β and 2β-1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
本申请一实施方式中，通过第二索引矩阵得到M_index包括：从M re中按行或按列或按对角方式选取预定数量的索引，将预定数量的索引作为M_index。 In an embodiment of the present application, obtaining the M_index by using the second index matrix includes: selecting a predetermined number of indexes from the M re by row or column or diagonally, and taking a predetermined number of indexes as M_index.
本申请一实施方式中，从M re中按列选取预定数量的索引包括：从M re 中第p列选取K p个索引，其中，
Figure PCTCN2018085645-appb-000050
p为整数，且1≤p≤C re；从M re中按行选取预定数量的索引包括：从M re中第q行选取K q个索引，其中，
Figure PCTCN2018085645-appb-000051
q为整数，且1≤q≤R re；从M re中按对角方式选取预定数量的索引包括：从M re中第δ条对角线上选取K δ个索引，其中，
Figure PCTCN2018085645-appb-000052
δ为整数，且-min(R re,C re)+1≤δ≤max(R re,C re)-1；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 In an embodiment of the present application, selecting a predetermined number of indexes from the M re by the column includes: selecting K p indexes from the p- th column in the M re , wherein,
Figure PCTCN2018085645-appb-000050
p is an integer, and 1≤p≤C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein
Figure PCTCN2018085645-appb-000051
q is an integer, and 1 ≤ q ≤ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K δ indexes from the diagonal line of the δth line in M re , wherein
Figure PCTCN2018085645-appb-000052
δ is an integer, and -min(R re , C re )+1≤δ≤max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
本申请一实施方式中，从M re中按列选取预定数量的索引包括以下至少之一：从M re中依次从第1,2，…,C 1列选择K ic1个索引，其中
Figure PCTCN2018085645-appb-000053
1≤ic1≤C 1，1≤C 1≤C re，ic1和C 1为整数；从M re中依次从第C 2,C 2+1，…,C 3列选择K ic2个索引，其中
Figure PCTCN2018085645-appb-000054
C 2≤ic2≤C 3，1≤C 2≤C 3≤C re，ic2，C 2和C 3为整数；从M re中依次从第C 4,C 4+1，…,C re列选择K ic3个索引得到的，其中
Figure PCTCN2018085645-appb-000055
C 4≤ic3≤C re，1≤C 4≤C re，ic3和C 4为整数。 In an embodiment of the present application, selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein
Figure PCTCN2018085645-appb-000053
1 ≤ ic1 ≤ C 1 , 1 ≤ C 1 ≤ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein
Figure PCTCN2018085645-appb-000054
C 2 ≤ ic2 ≤ C 3 , 1 ≤ C 2 ≤ C 3 ≤ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which
Figure PCTCN2018085645-appb-000055
C 4 ≤ic3≤C re, 1≤C 4 ≤C re, ic3 and C 4 are integers.
本申请一实施方式中，从M re中按行选取预定数量的索引以下至少之一：从M re中依次从第1,2，…,R 1行选择K ir1个索引，其中
Figure PCTCN2018085645-appb-000056
1≤ir1≤R 1，1≤R 1≤R re，ir1和R 1为整数；从M re中依次从第R 2,R 2+1，…,R 3行选择K ir2个索引，其中
Figure PCTCN2018085645-appb-000057
R 2≤ir2≤R 3，1≤R 2≤R 3≤R re，ir2，R 2和R 3为整数；从M re中依次从第R 4,R 4+1，…,R re行选择K ir3个索引，其中
Figure PCTCN2018085645-appb-000058
1≤R 4≤R re，ir3和R 4为整数。 In an embodiment of the present application, at least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein
Figure PCTCN2018085645-appb-000056
1 ≤ ir1 ≤ R 1 , 1 ≤ R 1 ≤ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein
Figure PCTCN2018085645-appb-000057
R 2 ≤ ir2 ≤ R 3 , 1 ≤ R 2 ≤ R 3 ≤ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which
Figure PCTCN2018085645-appb-000058
1 ≤ R 4 ≤ R re , and ir3 and R 4 are integers.
本申请一实施方式中，从M re中按对角方式选取预定数量的索引包括以下至少之一：从M re中依次从第-min(R re,C re)+1,-min(R re,C re)+2，…,D 1条对角线选择K id1个索引，其中
Figure PCTCN2018085645-appb-000059
-min(R re,C re)+1≤D 1≤max(R re,C re)-1，id1和D 1为整数；从M re中依次从第D 2,D 2+1，…,D 3条对 角线选择K id2个索引，其中
Figure PCTCN2018085645-appb-000060
-min(R re,C re)+1≤D 2≤D 3≤max(R re,C re)-1，id2，D 2和D 3为整数；从M re中依次从第D 4,D 4+1，…,max(R re,C re)-1条对角线选择K id3个索引，其中
Figure PCTCN2018085645-appb-000061
-min(R re,C re)+1≤D 4≤max(R re,C re)-1，id3和D 4为整数；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 In an embodiment of the present application, selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where
Figure PCTCN2018085645-appb-000059
-min(R re , C re )+1≤D 1 ≤max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which
Figure PCTCN2018085645-appb-000060
-min(R re , C re )+1≤D 2 ≤D 3 ≤max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonally select K id3 indexes, of which
Figure PCTCN2018085645-appb-000061
-min(R re , C re )+1≤D 4 ≤max(R re ,C re )-1, id3 and D 4 are integers; wherein min(R re , C re ) denotes R re and C re The minimum of the two, max(R re , C re ), represents the maximum of both R re and C re .
本申请一实施方式中，在从M re中按行或按列或按对角方式选取预定数量的索引的过程中，跳过第二比特序列矩阵中未发送比特序列对应的索引，其中，所述第二比特序列矩阵为第一比特序列矩阵进行第二预定变换得到的，所述第一比特序列矩阵为所述极化码编码后比特序列组成，其中，所述第二预定变换包括：行置换或者列置换。 In an embodiment of the present application, in the process of selecting a predetermined number of indexes by row or column or diagonally from M re , skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, where The second bit sequence matrix is obtained by performing a second predetermined transform on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transform comprises: Replacement or column permutation.
本申请一实施方式中，从第二比特序列矩阵中选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列。In an implementation manner of the present application, selecting T bits from the second bit sequence matrix as the to-be-transmitted bit sequence includes: sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-sent Bit sequence.
本申请一实施方式中，从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中的起始位置t开始，按行或按列或按对角方式从第二比特序列矩阵中依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到第二比特序列矩阵中的最后一个比特或第一个比特继续选取，1≤t≤R vb×C vb。 In an embodiment of the present application, sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the bit sequence to be transmitted includes starting from a starting position t in the second bit sequence matrix. T bits are sequentially selected from the second bit sequence matrix by row or column or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the second bit is skipped The last bit or the first bit in the sequence matrix continues to be selected, 1 ≤ t ≤ R vb × C vb .
本申请一实施方式中，从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列包括：在T小于或者等于极化码编码后比特序列的长度N时，按列依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按行依次选取第二比特序列矩阵中的第1至T个比特或 者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按对角方式依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T大于极化码编码后比特序列的长度N时，从第二比特序列矩阵中第t个比特开始，按行或按列或按对角方式依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到最后一个比特或者第一个比特继续选取，其中，1≤t≤R vb×C vb；其中，N为正整数。 In an implementation manner of the present application, the T bits are sequentially selected from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence, including: the length of the bit sequence after T is less than or equal to the polarization code encoding. When N, the first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in columns; when T is less than or equal to the length N of the bit sequence after the polarization code is encoded, The row sequentially selects the 1st to Tth bits or the Nth T+1th to Nth bits in the second bit sequence matrix; when T is less than or equal to the length N of the bit sequence after the polarization code encoding, the diagonally Selecting 1st to Tth bits or N-T+1th to Nth bits in the second bit sequence matrix; when T is greater than the length N of the bit sequence after the polarization code encoding, the tth from the second bit sequence matrix Starting at the beginning of each bit, T bits are sequentially selected in rows or columns or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit is skipped. The bits continue to be selected, where 1≤t≤R vb ×C vb ; Where N is a positive integer.
本申请一实施方式中，从第二比特序列矩阵中按列依次选取T个比特包括以下至少之一：依次从第1,2，…,E 1列选择T ie1个比特，其中，
Figure PCTCN2018085645-appb-000062
1≤E 1≤C vb，ie1和E 1为整数；依次从第E 2,E 2+1，…,E 3列选择T ie2个比特，其中
Figure PCTCN2018085645-appb-000063
1≤E 2≤E 3≤C re，ie2，E 2和E 3为整数；依次从第E 4,E 4+1，…,E vb列选择T ie3个比特，其中
Figure PCTCN2018085645-appb-000064
1≤E 4≤C vb，ie3和E 4为整数。 An embodiment of the present application, the bit sequence from the second column of the matrix are sequentially selected by T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein
Figure PCTCN2018085645-appb-000062
1 ≤ E 1 ≤ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein
Figure PCTCN2018085645-appb-000063
1 ≤ E 2 ≤ E 3 ≤ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein
Figure PCTCN2018085645-appb-000064
1 ≤ E 4 ≤ C vb , ie3 and E 4 are integers.
本申请一实施方式中，从第二比特序列矩阵中按行依次选取T个比特包括以下至少之一：依次从第1,2，…,F 1行选择T if1个比特，其中
Figure PCTCN2018085645-appb-000065
1≤F 1≤R vb，if1和F 1为整数；依次从第F 2,F 2+1，…,F 3行选择T if2个比特，其中
Figure PCTCN2018085645-appb-000066
1≤F 2≤F 3≤R vb，if2，F 2和F 3为整数；依次从第F 4,F 4+1，…,R vb行选择T if3个比特，其中
Figure PCTCN2018085645-appb-000067
1≤F 4≤R vb，if3和F 4为整数。 In an embodiment of the present application, the T bits are sequentially selected from the second bit sequence matrix by at least one of the following: T if1 bits are sequentially selected from the first, second, ..., F 1 rows, wherein
Figure PCTCN2018085645-appb-000065
1 ≤ F 1 ≤ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein
Figure PCTCN2018085645-appb-000066
1≤F 2 ≤F 3 ≤R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein
Figure PCTCN2018085645-appb-000067
1 ≤ F 4 ≤ R vb , if3 and F 4 are integers.
本申请一实施方式中，从第二比特序列矩阵中按对角方式依次选取T个比特包括以下至少之一：依次从第-min(R vb,C re)+1,-min(R vb,C vb)+2，…,G 1条对角线选择T ig1个比特，其中
Figure PCTCN2018085645-appb-000068
-min(R vb,C vb)+1≤G 1≤max(R vb,C vb)-1，ig1和G 1为整数；依次从第G 2,G 2+1，…,G 3条对角线选择K ig2个比特，其中
Figure PCTCN2018085645-appb-000069
-min(R vb,C vb)+1≤G 2≤G 3≤max(R vb,C vb)-1，ig2，G 2和G 3为整数；依次从第G 4,G 4+1，…,max(R vb,C vb)-1 条对角线选择K id3个比特，其中
Figure PCTCN2018085645-appb-000070
-min(R vb,C vb)+1≤G 4≤max(R vb,C vb)-1，ig3和G 4为整数。 In an embodiment of the present application, the T bits are sequentially selected from the second bit sequence matrix in a diagonal manner, including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb )+2,...,G 1 diagonally selects T ig1 bits, of which
Figure PCTCN2018085645-appb-000068
-min(R vb , C vb ) +1 ≤ G 1 ≤ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which
Figure PCTCN2018085645-appb-000069
-min(R vb , C vb )+1≤G 2 ≤G 3 ≤max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally select K id3 bits, of which
Figure PCTCN2018085645-appb-000070
-min(R vb , C vb )+1≤G 4 ≤max(R vb , C vb )-1, ig3 and G 4 are integers.
本申请一实施方式中，所述M og的列数为32。 In an embodiment of the present application, the number of columns of the M og is 32.
根据本申请的一个实施例，提供了一种序列确定装置，包括：重排模块，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；编码模块，配置为将第二比特序列进行极化码编码，得到极化码编码后比特序列；选取模块，配置为从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T。According to an embodiment of the present application, a sequence determining apparatus is provided, including: a rearrangement module configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; and an encoding module And configured to perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code is encoded; and the selecting module is configured to select T bits from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence; wherein, K And T are positive integers, K ≤ T.
本申请一实施方式中，装置还包括：第一变换模块，配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。In an embodiment of the present application, the apparatus further includes: a first transforming module, configured to: obtain a second index matrix by using the first predetermined transform by the first index matrix; and obtain an M_index by using the second index matrix; wherein, the first predetermined transform includes: Row permutation or column permutation.
本申请一实施方式中，装置还包括：第二变换模块，配置为将极化码编码后比特序列组成第一比特序列矩阵；将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，第二预定变换包括：行置换或者列置换；选取模块，还配置为从第二比特序列矩阵中选取T个比特作为待发送比特序列。In an embodiment of the present application, the apparatus further includes: a second transform module configured to form a bit sequence of the first bit sequence matrix by encoding the bit code sequence; and performing a second predetermined transform on the first bit sequence matrix to obtain a second bit sequence a matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted.
本申请一实施方式中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 In one embodiment of the present application embodiment, the second index matrix of M re, M re matrix R re row C re column, a first index matrix is M or, M or is
Figure PCTCN2018085645-appb-000071
或者，
Figure PCTCN2018085645-appb-000071
or,
Figure PCTCN2018085645-appb-000072
Figure PCTCN2018085645-appb-000072
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R re不变的情况下，C re为满足R re×C re≥N的最小值；或者，在C re不变的情况下，R re为满足R re×C re≥N的最小值。 In an embodiment of the present application, when R re is constant, C re is a minimum value satisfying R re ×C re ≥N; or, in the case where C re is constant, R re is satisfying R re ×C Re ≥ the minimum value of N.
本申请一实施方式中，第一索引矩阵配置为通过以下至少之一方式得到第二索引矩阵：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 In an embodiment of the present application, the first index matrix is configured to obtain the second index matrix by at least one of the following: the ith column of M re is obtained by column permutation of the π 1 (i) column of M or 0≤i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; M re j-M or behavior of π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j and π 2 (j) are positive integers.
本申请一实施方式中，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 In an embodiment of the present application, the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000073
或者，
Figure PCTCN2018085645-appb-000073
or,
Figure PCTCN2018085645-appb-000074
Figure PCTCN2018085645-appb-000074
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000075
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000075
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R vb不变的情况下，C vb为满足R vb×C vb≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N的最小值。 In an embodiment of the present application, when V vb is constant, C vb is a minimum value satisfying R vb × C vb ≥ N; or, in the case where C vb is constant, R vb is satisfying R vb × C The minimum value of vb ≥ N.
本申请一实施方式中，第二比特序列矩阵配置为通过以下至少之一方式得到第二比特序列矩阵：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 In an embodiment of the present application, the second bit sequence matrix is configured to obtain the second bit sequence matrix by at least one of the following: the gth column of the M vb is the π 3 (g) column of the M og is replaced by the column, wherein, 0≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; M vb behavior of the h a first π M og 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π 4 (h) ≤R vb -1, R vb × C vb ≥N, h , and π 4 (h) are positive integers.
本申请一实施方式中，所述M og的列数为32。 In an embodiment of the present application, the number of columns of the M og is 32.
根据本申请的一个实施例，提供了一种设备，包括：处理器，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；以及从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T；存储器，与处理器耦接。According to an embodiment of the present application, there is provided an apparatus, comprising: a processor configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; Performing polarization code encoding to obtain a bit sequence after polarization code encoding; and selecting T bits from the bit sequence after polarization code encoding as a bit sequence to be transmitted; wherein, K and T are positive integers, K≤T; , coupled to the processor.
本申请一实施方式中，处理器，还配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。In an embodiment of the present application, the processor is further configured to: obtain a second index matrix by using a first predetermined transform by the first index matrix; and obtain an M_index by using the second index matrix; where the first predetermined transform includes: row permutation or column permutation .
本申请一实施方式中，处理器，还配置为将极化码编码后比特序列组成第一比特序列矩阵；将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；以及从第二比特序列矩阵中选取T个比特作为待发送比特序列其中，第二预定变换包括：行置换或者列置换。In an embodiment of the present application, the processor is further configured to: compose the bit sequence encoded by the polarization code into a first bit sequence matrix; perform a second predetermined transform on the first bit sequence matrix to obtain a second bit sequence matrix; The T bits are selected as the to-be-transmitted bit sequence in the two-bit sequence matrix, and the second predetermined transform includes: row permutation or column permutation.
本申请一实施方式中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 In an embodiment of the present application, the second index matrix is M re , and M re is a matrix of R re rows C re columns, and the first index matrix is M or M or
Figure PCTCN2018085645-appb-000076
或者，
Figure PCTCN2018085645-appb-000076
or,
Figure PCTCN2018085645-appb-000077
Figure PCTCN2018085645-appb-000077
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R re不变的情况下，C re为满足R re×C re≥N的最小值；或者，在C re不变的情况下，R re为满足R re×C re≥N的最小值。 In an embodiment of the present application, when R re is constant, C re is a minimum value satisfying R re ×C re ≥N; or, in the case where C re is constant, R re is satisfying R re ×C Re ≥ the minimum value of N.
本申请一实施方式中，处理器还配置为通过以下至少之一得到第二索引矩阵：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 In an embodiment of the present application, the processor is further configured to obtain, by at least one of the following, the second index matrix: the ith column of M re is obtained by column permutation of the π 1 (i) column of M or , where 0 ≤ i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; M or behavior of the j-th of the M re π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j and π 2 (j ) are positive integers.
本申请一实施方式中，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 In an embodiment of the present application, the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000078
或者，
Figure PCTCN2018085645-appb-000078
or,
Figure PCTCN2018085645-appb-000079
Figure PCTCN2018085645-appb-000079
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000080
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000080
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
本申请一实施方式中，在R vb不变的情况下，C vb为满足R vb×C vb≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N的最小值。 In an embodiment of the present application, when V vb is constant, C vb is a minimum value satisfying R vb × C vb ≥ N; or, in the case where C vb is constant, R vb is satisfying R vb × C The minimum value of vb ≥ N.
本申请一实施方式中，处理器还配置为通过以下至少之一得到第二比特序列矩阵：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 In an embodiment of the present application, the processor is further configured to obtain the second bit sequence matrix by at least one of the following: the gth column of the M vb is the π 3 (g) column of the M og , and the column is replaced by, where, ≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; h-M vb behavior of the M og of π 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π 4 (h) ≤R vb -1, R vb × C vb ≥N, h and π 4 ( h) are positive integers.
本申请一实施方式中，所述M og的列数为32。 In an embodiment of the present application, the number of columns of the M og is 32.
根据本申请的又一个实施例，还提供了一种存储介质，所述存储介质包括存储的程序，其中，所述程序运行时执行上述任一项所述的方法。According to still another embodiment of the present application, there is also provided a storage medium comprising a stored program, wherein the program is executed to perform the method of any of the above.
根据本申请的又一个实施例，还提供了一种处理器，所述处理器配置为运行程序，其中，所述程序运行时执行上述任一项所述的方法。According to still another embodiment of the present application, there is also provided a processor configured to execute a program, wherein the program is executed to perform the method of any of the above.
通过本申请，将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列，即本申请提供了一种待发送比特序列的确定方法，因而解决了上述相关技术中5G New RAT中没有相应的序列确定方法的问题。Through the present application, a first bit sequence of length K bits is mapped to a specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding; The T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
附图说明DRAWINGS
此处所说明的附图用来提供对本申请的进一步理解，构成本申请的一部分，本申请的示意性实施例及其说明用于解释本申请，并不构成对本申请的不当限定。在附图中：The drawings described herein are intended to provide a further understanding of the present application, and are intended to be a part of this application. In the drawing:
图1是本申请实施例的一种序列确定方法的移动终端的硬件结构框图；1 is a block diagram showing a hardware structure of a mobile terminal according to a sequence determining method according to an embodiment of the present application;
图2是根据本申请实施例的序列确定方法的流程图；2 is a flowchart of a sequence determining method according to an embodiment of the present application;
图3是根据本申请实施例的序列确定装置的结构框图；FIG. 3 is a structural block diagram of a sequence determining apparatus according to an embodiment of the present application; FIG.
图4是根据本申请实施例3提供的设备的结构框图。4 is a structural block diagram of a device according to Embodiment 3 of the present application.
具体实施方式detailed description
下文中将参考附图并结合实施例来详细说明本申请。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。The present application will be described in detail below with reference to the drawings in conjunction with the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.
需要说明的是，本申请的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。It should be noted that the terms "first", "second" and the like in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or order.
实施例1Example 1
本申请实施例1所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。以运行在移动终端上为例，图1是本申请实施例的一种序列确定方法的移动终端的硬件结构框图。如图1所示，移动终端10可以包括一个或多个(图中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)、用于存储数据的存储器104、以及用于通信功能的传输装置106。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述电子装置的结构造成限定。例如，移动终端10还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。The method embodiment provided by Embodiment 1 of the present application can be executed in a mobile terminal, a computer terminal or the like. Taking a mobile terminal as an example, FIG. 1 is a hardware structural block diagram of a mobile terminal of a sequence determining method according to an embodiment of the present application. As shown in FIG. 1, the mobile terminal 10 may include one or more (only one shown) processor 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA). A memory 104 for storing data, and a transmission device 106 for communication functions. It will be understood by those skilled in the art that the structure shown in FIG. 1 is merely illustrative and does not limit the structure of the above electronic device. For example, the mobile terminal 10 may also include more or fewer components than those shown in FIG. 1, or have a different configuration than that shown in FIG.
存储器104可用于存储应用软件的软件程序以及模块，如本申请实施例中的序列确定方法对应的程序指令/模块，处理器102通过运行存储在存储器104内的软件程序以及模块，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端10。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。The memory 104 can be used to store software programs and modules of application software, such as program instructions/modules corresponding to the sequence determining method in the embodiment of the present application, and the processor 102 executes various programs by running software programs and modules stored in the memory 104. Functional application and data processing, that is, the above method is implemented. Memory 104 may include high speed random access memory, and may also include non-volatile memory such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory. In some examples, memory 104 may further include memory remotely located relative to processor 102, which may be connected to mobile terminal 10 over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
传输装置106用于经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端10的通信供应商提供的无线网络。在一个实例中，传输装置106包括一个网络适配器(Network Interface Controller，NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输装置106可以为射频(Radio Frequency，RF)模块，其用于通过无线方式与互联网进行通讯。Transmission device 106 is for receiving or transmitting data via a network. The above-described network specific example may include a wireless network provided by a communication provider of the mobile terminal 10. In one example, the transmission device 106 includes a Network Interface Controller (NIC) that can be connected to other network devices through a base station to communicate with the Internet. In one example, the transmission device 106 can be a Radio Frequency (RF) module for communicating with the Internet wirelessly.
本申请实施例1所提供的方法实施例也可以在网络侧设备，比如基站中执行，但并不限于此。The method embodiment provided by Embodiment 1 of the present application may also be performed in a network side device, such as a base station, but is not limited thereto.
在本实施例中提供了一种运行于上述移动终端或网络侧设备的序列确定方法，图2是根据本申请实施例的序列确定方法的流程图，如图2所示，该流程包括如下步骤：In this embodiment, a sequence determining method is performed on the mobile terminal or the network side device. FIG. 2 is a flowchart of a sequence determining method according to an embodiment of the present application. As shown in FIG. 2, the process includes the following steps. :
步骤S202，将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；Step S202, mapping a first bit sequence of length K bits to a specified position according to M_index, to obtain a second bit sequence;
步骤S204，将第二比特序列进行极化码编码，得到极化码编码后比特序列；Step S204, performing polarization code encoding on the second bit sequence to obtain a bit sequence after encoding the polarization code;
步骤S206，从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T。Step S206, selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein K and T are positive integers, K≤T.
通过上述步骤，将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列，即本申请提供了一种待发送比特序列的确定方法，因而解决了上述相关技术中5G New RAT中没有相应的序列确定方法的问题。Through the above steps, the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding; The T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
需要说明的是，在上述步骤S202之前，上述方法还可以包括：将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。即在极化码编码 过程中，第一索引矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一索引矩阵的另一维数即可，因此，可以在极化码的实现过程中，可以实现硬件的复用，因此，可以解决相关技术中极化码编码过程中硬件不能复用的问题。It should be noted that, before the step S202, the method may further include: obtaining a second index matrix by using a first predetermined transform by the first index matrix; obtaining an M_index by using the second index matrix; wherein the first predetermined transform includes: Replacement or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
需要说明的是，在从极化码编码后比特序列中选取T个比特作为待发送比特序列之前，方法还包括：将极化码编码后比特序列组成第一比特序列矩阵；将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，第二预定变换包括：行置换或者列置换；从极化码编码后比特序列中选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中选取T个比特作为待发送比特序列。即第一比特序列矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一比特序列矩阵的另一维数即可，因而可以在极化码的实现过程中，可以进一步实现硬件的复用，因此，进一步解决相关技术中极化码编码过程中硬件不能复用的问题。It should be noted that, before selecting the T bits from the bit sequence after the polarization code encoding as the to-be-transmitted bit sequence, the method further includes: forming the bit sequence of the polarization code into a first bit sequence matrix; and the first bit sequence Performing a second predetermined transform on the matrix to obtain a second bit sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted includes: T bits are selected in the two-bit sequence matrix as the bit sequence to be transmitted. That is, the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed. The multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
需要说明的是，在将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵之后，上述方法还可以包括：将第二比特序列矩阵中比特序列存储在缓存中，从缓存中选取T个比特作为待发送比特序列。It should be noted that after performing the second predetermined transform on the first bit sequence matrix to obtain the second bit sequence matrix, the method may further include: storing the bit sequence in the second bit sequence matrix in the cache, and selecting from the cache. T bits are used as a sequence of bits to be transmitted.
需要说明的是，上述缓存可以表现为其他物理实体，或者逻辑存在，但并不限于此。It should be noted that the foregoing cache may be represented by other physical entities or logically, but is not limited thereto.
需要说明的是，上述第一索引矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一索引矩阵为二维矩阵为例，上述第一预定变换可以表现为：第一索引矩阵的行变换模式相同或者列变换模式相同。It should be noted that the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto. For example, the first index matrix is a two-dimensional matrix, and the first predetermined transform may be used. It is expressed as follows: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
以上述第一索引矩阵为二维矩阵为例，在本申请的一个实施例中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 Taking the first index matrix as a two-dimensional matrix as an example, in one embodiment of the present application, the second index matrix is M re , and M re is a matrix of R re rows C re columns, and the first index matrix is M or M or is
Figure PCTCN2018085645-appb-000081
或者，
Figure PCTCN2018085645-appb-000081
or,
Figure PCTCN2018085645-appb-000082
Figure PCTCN2018085645-appb-000082
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
需要说明的是，上述R re和C re具有以下特征之一：在R re不变的情况下，C re为满足R re×C re≥N的最小值；在C re不变的情况下，R re为满足R re×C re≥N的最小值。 It should be noted that the above R re and C re have one of the following characteristics: in the case where R re is constant, C re is a minimum value satisfying R re ×C re ≥N; in the case where C re is constant, R re is a minimum value satisfying R re × C re ≥ N.
需要说明的是，将第一索引矩阵经过第一预定变换得到第二索引矩阵包括以下至少之一：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 It should be noted that, the first index matrix is subjected to the first predetermined transformation to obtain the second index matrix, including at least one of the following: the ith column of M re is obtained by column permutation of the π 1 (i) column of M or , 0≤i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; j-M behavior of Re M or of π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j and [pi] 2 (j) are positive integers.
在极化码编码过程中，由于M or到M re的每一行的置换模式相同，若固定M or和M re的列数，当极化码的母码长度(mother code length)变化时，只需要改变M or和M re的行数；或者，所述M or到M re的每一列的置换模式相同，若固定M or和M re的行数，当极化码的母码长度(mother code length)变化时，只需要改变M or和M re的列数。从而在极化码的实现过程中，对输入比特序列到编码器输入位置映射的硬件若是针对最大母码长度N max，则也适用于母码长度小于N max的情形，从而实现了硬件复用。 Polarization code encoding process, due to M or M re the same permutation pattern for each row, if the fixed number of columns and M or M re when polarization mother code length code (mother code length) changes, only It is necessary to change the number of rows of Mor and M re ; or, the permutation mode of each column of Mor to M re is the same, if the number of rows of Mor and M re is fixed, when the mother code length of the polarization code (mother code) When changing length, you only need to change the number of columns of M or M re . Therefore, in the implementation of the polarization code, if the hardware of the input bit sequence to the encoder input position mapping is for the maximum mother code length N max , it is also applicable to the case where the mother code length is less than N max , thereby realizing hardware multiplexing. .
需要说明的是，上述M og的列数为32。 It should be noted that the number of columns of the above M og is 32.
需要说明的是，上述π 1(i)通过以下至少之一方式获取：方式一：π 1(i)＝BRO(i)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数i转换为第一二进制数(B n1-1,B n1-2,…,B 0)，将第一二进制数反序排列得到第二二进制数(B 0,B 1,…,B n1-1)，再将第二二进制数转换成十进制数得到π 1(i)，其中，n1＝log 2(C re)，0≤i≤C re-1；方式二：π 1(i)＝{S1,S2,S3}，其中，S1＝{0,1,…,i1-1}，S2＝{i2,i3,i2+1,i3+1,…,i4,i5}，S3为{0,1,…,C re-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C re/8≤i1≤i2≤C re/3,i2≤i4≤i3≤2C re/3,i3≤i5≤C re-1，其中，i1、i2、i3、i4和i5均为正整数，且S1，S2与S3任意两者的交集为空集；方式三：π 1(i)＝{I}，其中，序列{I}由M or的列索引r按照函数f(r)计算得到的数值结果升序或降序顺序排列得到，0≤r≤C re-1，f(r)具有单调性。 It should be noted that the above π 1 (i) is obtained by at least one of the following manners: mode 1: π 1 (i)=BRO(i), wherein BRO() represents a bit reverse sequence operation, and the bit reverse sequence operation includes: i decimal number into a first binary number (B n1-1, B n1-2, ... , B 0), the reverse order of the first binary number to obtain a second binary number (B 0, B 1 ,...,B n1-1 ), and then converting the second binary number into a decimal number to obtain π 1 (i), where n1=log 2 (C re ), 0≤i≤C re -1; Manner 2: π 1 (i)={S1, S2, S3}, where S1={0,1,...,i1-1},S2={i2,i3,i2+1,i3+1,..., I4, i5}, S3 is a set of {0, 1, ..., C re -1} except for the element included in S1 and the element included in S2, where C re /8 ≤ i1 ≤ i2 ≤ C re /3, i2 ≤ i4 ≤ i3 ≤ 2C re /3, i3 ≤ i5 ≤ C re -1, wherein i1, i2, i3, i4 and i5 are both positive integers, and any of S1, S2 and S3 The intersection of the set is an empty set; mode 3: π 1 (i)={I}, wherein the sequence {I} is arranged by the column index r of the M or the numerical result calculated by the function f(r) in ascending or descending order. 0≤r≤C re -1,f(r) has Monotonic.
以下举例说明上述三种方式：The following examples illustrate the above three methods:
对于方式一：若C re＝8，i＝6，则n1＝log 2(8)＝3，将i＝6转换成二进制数(B 2,B 1,B 0)＝(1,1,0)，将所述二进制数(B 2,B 1,B 0)＝(1,1,0)反序排列得到(B 0,B 1,B 2)＝(0,1,1)，再将所述二进制数(B 0,B 1,B 2)＝(0,1,1)转换成十进制得到π 1(i)＝3。 For mode one: if C re =8, i=6, then n1=log 2 (8)=3, convert i=6 into binary number (B 2 , B 1 , B 0 )=(1,1,0 ), the binary numbers (B 2 , B 1 , B 0 )=(1,1,0) are arranged in reverse order to obtain (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ), and then The binary number (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ) is converted into decimal to obtain π 1 (i)=3.
对于方式二：若C re＝8，i 1＝2，i 2＝2，i 3＝4，i 4＝3，i 5＝5，则将S1＝{0,1}，S2＝{2,4,3,5}，S3＝{6,7}；π 1(i)＝{0,1,2,4,3,5,6,7}。 For mode two: If C re = 8, i 1 = 2, i 2 = 2, i 3 = 4, i 4 = 3, i 5 = 5, then S1 = {0, 1}, S2 = {2, 4,3,5}, S3={6,7}; π 1 (i)={0,1,2,4,3,5,6,7}.
对于方式三：C re＝8，{f(0),…,f(7)}＝{0,1,1.18,2.18,1.41,2.41,2.60,3.60}，将f(0),…,f(7)从小到大排列，则得到π 1(i)＝{1,2,3,5,4,6,7,8}。 For mode three: C re =8, {f(0),...,f(7)}={0,1,1.18,2.18,1.41,2.41, 2.60, 3.60}, f(0),...,f (7) From small to large, π 1 (i) = {1, 2, 3, 5, 4, 6, 7, 8} is obtained.
需要说明的是，f(r)包括以下至少之一：It should be noted that f(r) includes at least one of the following:
Figure PCTCN2018085645-appb-000083
(B n1-1,B n1-2,…,B 0)为索引r的二进制表示，0≤m1≤n1-1，n1＝log 2(C re)，k为正整数；比如：C re＝8，i＝6，k＝4，则n1＝log 2(8)＝3，将i＝6转换成二进制数(B 2,B 1,B 0)＝(1,1,0),
Figure PCTCN2018085645-appb-000084
需要说明的是，错误！未找到引用源。为求和公式；
Figure PCTCN2018085645-appb-000083
(B n1-1, B n1-2, ... , B 0) is the binary representation of the index r, 0≤m1≤n1-1, n1 = log 2 ( C re), k is a positive integer; for example: C re = 8, i=6, k=4, then n1=log 2 (8)=3, convert i=6 into a binary number (B 2 , B 1 , B 0 )=(1,1,0),
Figure PCTCN2018085645-appb-000084
Need to explain is that the error! The reference source was not found. For the summation formula;
将r对应的的函数值初始化为
Figure PCTCN2018085645-appb-000085
在
Figure PCTCN2018085645-appb-000086
的基础上按照第一迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000087
其中,第一迭代计算公式为
Figure PCTCN2018085645-appb-000088
其中，
Figure PCTCN2018085645-appb-000089
为r处的对数似然比均值；比如：
Figure PCTCN2018085645-appb-000090
可近似为
Figure PCTCN2018085645-appb-000091
参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000085
in
Figure PCTCN2018085645-appb-000086
Based on the first iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000087
Wherein, the first iteration calculation formula is
Figure PCTCN2018085645-appb-000088
among them,
Figure PCTCN2018085645-appb-000089
Is the log likelihood ratio mean at r; for example:
Figure PCTCN2018085645-appb-000090
Approximate
Figure PCTCN2018085645-appb-000091
The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000092
σ 2为噪声方差，C re＝8，σ 2＝0，将
Figure PCTCN2018085645-appb-000093
代入迭代公式，得到
Figure PCTCN2018085645-appb-000094
然后将
Figure PCTCN2018085645-appb-000095
代入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000096
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000097
而
Figure PCTCN2018085645-appb-000098
0≤r≤C re-1，,{f(0),…,f(7)}＝{0.04,0.41,0.61,3.29,1.00,4.56,5.78,16.00}； Assumed initial value
Figure PCTCN2018085645-appb-000092
σ 2 is the noise variance, C re =8, σ 2 =0, will
Figure PCTCN2018085645-appb-000093
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000094
followed by
Figure PCTCN2018085645-appb-000095
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000096
And so on, until the calculation is
Figure PCTCN2018085645-appb-000097
and
Figure PCTCN2018085645-appb-000098
0 ≤ r ≤ C re -1,, {f(0), ..., f(7)} = {0.04, 0.41, 0.61, 3.29, 1.00, 4.56, 5.78, 16.00};
将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000099
然后在
Figure PCTCN2018085645-appb-000100
的基础上按照第二迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000101
其中，第二迭代计算公式为
Figure PCTCN2018085645-appb-000102
为r处的互信息；其中，1≤m2≤n1，1≤m3≤n1，r1,r2,2r和2r-1均为大于或者等于0且小于或者等于C re-1的整数；其中，参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000099
Then at
Figure PCTCN2018085645-appb-000100
Based on the second iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000101
Wherein, the second iteration calculation formula is
Figure PCTCN2018085645-appb-000102
Is the mutual information at r; wherein, 1 ≤ m2 ≤ n1, 1 ≤ m3 ≤ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1; The iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000103
C re＝8，将
Figure PCTCN2018085645-appb-000104
代入迭代公式，得到
Figure PCTCN2018085645-appb-000105
然后将
Figure PCTCN2018085645-appb-000106
代入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000107
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000108
而f(r)＝
Figure PCTCN2018085645-appb-000109
0≤i≤C re-1，{f(0),…,f(7)}＝{0.008,0.152,0.221,0.682,0.313,0.779,0.850,0.991}。 Assumed initial value
Figure PCTCN2018085645-appb-000103
C re =8, will
Figure PCTCN2018085645-appb-000104
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000105
followed by
Figure PCTCN2018085645-appb-000106
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000107
And so on, until the calculation is
Figure PCTCN2018085645-appb-000108
And f(r)=
Figure PCTCN2018085645-appb-000109
0 ≤ i ≤ C re -1, {f(0), ..., f(7)} = {0.008, 0.152, 0.221, 0.682, 0.313, 0.779, 0.850, 0.991}.
需要说明的是，上述π 2(j)通过以下至少之一方式获取：π 2(j)＝BRO(j)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数j转 换为第三二进制数(B n2-1,B n2-2,…,B 0)，将第三二进制数反序排列得到第四二进制数(B 0,B 1,…,B n2-1)，再将第四二进制数转换成十进制数得到π 2(j)，其中，n2＝log 2(R re)，0≤j≤R re-1；π 2(j)＝{S4,S5,S6}，其中，S4＝{0,1,…,j1-1}，S5＝{j2,j3,j2+1,j3+1,…,j4,j5}，S6为{0,1,…,R re-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R re/8≤j1≤j2≤R re/3,j2≤j4≤j3≤2 R re/3,j3≤j5≤R re-1，其中，j1、j2、j3、j4和j5均为正整数，且S4，S5与S6任意两者的交集为空集；π 2(j)＝{J}，其中，序列{J}中由M or的行索引s按照函数f(s)计算得到的数值结果升序或降序顺序排列得到，0≤s≤R re-1，f(s)具有单调性。 It should be noted that the above π 2 (j) is obtained by at least one of the following methods: π 2 (j)=BRO(j), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number j into a third binary number (B n2-1, B n2-2, ... , B 0), the third binary number in reverse order to obtain a fourth binary number (B 0, B 1, ..., B n2-1 ), and then convert the fourth binary number into a decimal number to obtain π 2 (j), where n2 = log 2 (R re ), 0 ≤ j ≤ R re -1; π 2 ( j)={S4, S5, S6}, where S4={0,1,...,j1-1}, S5={j2,j3,j2+1,j3+1,...,j4,j5},S6 A set consisting of elements other than the element contained in S4 and the element contained in S5 in {0, 1, ..., R re -1}, where R re /8 ≤ j1 ≤ j2 ≤ R re /3, j2 ≤j4≤j3≤2 R re / 3, j3≤j5≤R re -1, wherein, j1, j2, j3, j4 and j5 are positive integers, and S4, S5 and S6 of any two intersection is empty ; π 2 (j) = { J}, where the sequence {J} in ascending or descending order numerical results obtained from the obtained M or arranged in a row s index calculated according to the function f (s), 0≤s≤R re - 1, f (s) has monotonicity.
需要说明的是，f(s)包括以下至少之一：
Figure PCTCN2018085645-appb-000110
(B n2-1,B n2-2,…,B 0)为索引s的二进制表示，0≤m4≤n2-1，n2＝log 2(R re)，k为正整数；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000111
在
Figure PCTCN2018085645-appb-000112
的基础上按照第三迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000113
其中,第三迭代计算公式为
Figure PCTCN2018085645-appb-000114
其中，
Figure PCTCN2018085645-appb-000115
为s处的对数似然比均值；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000116
然后在
Figure PCTCN2018085645-appb-000117
的基础上按照第四迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000118
其中，第四迭代计算公式为
Figure PCTCN2018085645-appb-000119
其中，
Figure PCTCN2018085645-appb-000120
为s处的互信息；其中，1≤m5≤n2，1≤m6≤n2，s1,s2,2s和2s-1均为大于或者等于0且小于或者等于R re-1的整数。 It should be noted that f(s) includes at least one of the following:
Figure PCTCN2018085645-appb-000110
(B n2-1, B n2-2, ... , B 0) is the binary representation of the index s, 0≤m4≤n2-1, n2 = log 2 ( R re), k is a positive integer; s function corresponding The value is initialized to
Figure PCTCN2018085645-appb-000111
in
Figure PCTCN2018085645-appb-000112
Based on the third iteration formula, after n2 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000113
Wherein, the third iteration calculation formula is
Figure PCTCN2018085645-appb-000114
among them,
Figure PCTCN2018085645-appb-000115
Is the log likelihood ratio mean at s; initializes the function value corresponding to s to
Figure PCTCN2018085645-appb-000116
Then at
Figure PCTCN2018085645-appb-000117
Based on the fourth iteration formula, n2 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000118
Wherein, the fourth iteration calculation formula is
Figure PCTCN2018085645-appb-000119
among them,
Figure PCTCN2018085645-appb-000120
Is the mutual information at s; wherein, 1 ≤ m5 ≤ n2, 1 ≤ m6 ≤ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
需要说明的是，上述对于π 2(j)的解释，参考π 1(i)的解释。 It should be noted that the above explanation for π 2 (j) refers to the explanation of π 1 (i).
需要说明的是，上述第一比特序列矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一比特序列矩阵为二维矩阵为例，上述第二预定义变换为：第一比特序列矩阵的行变换模式相同或 者列变换模式相同。It should be noted that the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto. The first bit sequence matrix is a two-dimensional matrix, for example, the second pre- The definition transformation is: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
需要说明的是，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 It should be noted that the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000121
或者，
Figure PCTCN2018085645-appb-000121
or,
Figure PCTCN2018085645-appb-000122
Figure PCTCN2018085645-appb-000122
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000123
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000123
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
需要说明的是，在R vb不变的情况下，C vb为满足R vb×C vb≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N的最小值。 Incidentally, in the case where the constant R vb, C vb is the minimum value satisfying R vb × C vb ≥N; or in the case of constant C vb, R vb is satisfied R vb × C vb ≥ The minimum value of N.
需要说明的是，将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵包括以下至少之一：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 Note that, the first bit sequence to a second predetermined matrix transformation matrix to obtain a second bit sequence comprising at least one of: the first g M vb π M og ranked in 3 (g) after column permutation column to give wherein, 0≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; M vb of the h behavior of π M og 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π (h) 4 ≤R vb -1, R vb × C vb ≥N, Both h and π 4 (h) are positive integers.
在编码过程中，从编码后比特序列中选择合适的比特组成待发送比特序列即为速率匹配的过程。在极化码编码过程中，由于M og到M vb的每一行的置换模式相同，若固定M og和M vb的列数，当极化码的母码长度(mother code length)变化时，只需要改变M og和M vb的行数；或者，M og到M vb的每一列的置换模式相同，若固定M og和M vb的行数，当极化码的母码长度(mother code length)变化时，只需要改变M og和M vb的列数。 In the encoding process, selecting a suitable bit from the encoded bit sequence to form a bit sequence to be transmitted is a process of rate matching. In the polarization code encoding process, since the permutation mode of each line of M og to M vb is the same, if the number of columns of M og and M vb is fixed, when the mother code length of the polarization code changes, only It is necessary to change the number of rows of M og and M vb ; or, the permutation mode of each column of M og to M vb is the same, if the number of rows of M og and M vb is fixed, when the mother code length of the polarization code (mother code length) When changing, only the number of columns of M og and M vb needs to be changed.
从而在极化码的实现过程中，对输入比特序列到极化码编码器输入位置映射的硬件若是针对最大母码长度N max，则也适用于母码长度小于N max的情形，从而实现了硬件复用。 Therefore, in the implementation process of the polarization code, if the hardware of the input bit sequence to the polarization code encoder input position mapping is for the maximum mother code length N max , it is also applicable to the case where the mother code length is less than N max , thereby realizing Hardware reuse.
需要说明的是，π 3(g)通过以下至少之一方式获取：π 3(g)＝BRO(g)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数g转换为第五二进制数(B n3-1,B n3-2,…,B 0)，将第五二进制数反序排列得到第六二进制数(B 0,B 11,…,B n3-1)，再将第六二进制数转换成十进制数得到π 3(g)，其中，n3＝log 2(C vb)，0≤g≤C vb-1；π 3(g)＝{S1,S2,S3}，其中，S1＝{0,1,…,g1-1}，S2＝{g2,g3,g2+1,g3+1,…,g4,g5}，S3为{0,1,…,C vb-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C vb/8≤g1≤g2≤C vb/3,g2≤g4≤g3≤2C vb/3,g3≤g5≤C vb-1，其中，g1、g2、g3、g4和g5均为正整数，且S1，S2与S3任意两者的交集为空集；π 3(g)＝{G}，其中，序列{G}由M og的列索引α按照函数f(α)计算得到的数值结果升序或降序顺序排列得到，0≤α≤C vb-1，f(α)具有单调性；π 3(g)＝{Q1,Q2,Q3},其中，Q2＝{q1,q2,q1+1,q2+1,…,q3,q4}，其中0≤q1<q3≤(C vb-1)/2,0≤q2<q4≤(C vb-1)/2,q1,q2,q3和q4均为正整数,Q1和Q3为{0,1，…，C vb-1}与Q2差集中的其他元素，且Q1,Q2,Q3任意两者的交集为空集；在nV1个相同位置上π 3(g)与预定义序列V1的元素不同，其中，V1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nV1≤23；在nV2个相同位置上π 3(g)与预定义序列V2的元素不同，其中，V2＝{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}，0≤nV2≤3。 It should be noted that π 3 (g) is obtained by at least one of the following: π 3 (g)=BRO(g), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number g Converted to a fifth binary number (B n3-1 , B n3-2 , ..., B 0 ), and the fifth binary number is arranged in reverse order to obtain a sixth binary number (B 0 , B 11 ,... , B n3-1 ), and then convert the sixth binary number into a decimal number to obtain π 3 (g), where n3=log 2 (C vb ), 0≤g≤C vb -1; π 3 (g )={S1,S2,S3}, where S1={0,1,...,g1-1},S2={g2,g3,g2+1,g3+1,...,g4,g5},S3 is {0,1,..., C vb -1} A set of elements other than the element contained in S1 and the element contained in S2, wherein C vb /8 ≤ g1 ≤ g2 ≤ C vb / 3, g2 ≤ G4 ≤ g3 ≤ 2C vb /3, g3 ≤ g5 ≤ C vb -1, wherein g1, g2, g3, g4 and g5 are all positive integers, and the intersection of any of S1, S2 and S3 is an empty set; π 3 (g)={G}, where the sequence {G} is arranged in ascending or descending order by the numerical result calculated by the function f(α) of the column index α of the M og , 0 ≤ α ≤ C vb -1, f (α) has monotonicity; π 3 (g) = {Q1, Q2, Q3}, which Where Q2={q1,q2,q1+1,q2+1,...,q3,q4}, where 0≤q1<q3≤(C vb -1)/2,0≤q2<q4≤(C vb - 1) /2, q1, q2, q3 and q4 are positive integers, Q1 and Q3 are {0, 1, ..., C vb -1} and other elements in the Q2 difference set, and any of Q1, Q2, Q3 The intersection is an empty set; π 3 (g) is different from the element of the predefined sequence V1 at the same position of nV1, where V1={0,1,2,3,4,5,6,7,8,9 ,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nV1≤ 23; π 3 (g) is different from the element of the predefined sequence V2 at the same position of nV2, where V2={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}, 0 ≤ nV2 ≤ 3.
需要说明的是，f(α)包括以下至少之一：
Figure PCTCN2018085645-appb-000124
(B n3-1,B n3-2,…,B 0)为索引α的二进制表示，0≤m6≤n3-1，n3＝log 2(C vb)，k 为正整数；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000125
在
Figure PCTCN2018085645-appb-000126
的基础上按照第五迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000127
其中,第五迭代计算公式为
Figure PCTCN2018085645-appb-000128
其中，
Figure PCTCN2018085645-appb-000129
为r处的对数似然比均值；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000130
然后在
Figure PCTCN2018085645-appb-000131
的基础上按照第六迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000132
其中，第六迭代计算公式为
Figure PCTCN2018085645-appb-000133
为r处的互信息；其中，1≤m7≤n3，1≤m8≤n3，α1,α2,2α和2α-1均为大于或者等于0且小于或者等于C vb-1的整数。 It should be noted that f(α) includes at least one of the following:
Figure PCTCN2018085645-appb-000124
(B n3-1 , B n3-2 , ..., B 0 ) is a binary representation of the index α, 0 ≤ m6 ≤ n3-1, n3 = log 2 (C vb ), k is a positive integer; a function corresponding to α The value is initialized to
Figure PCTCN2018085645-appb-000125
in
Figure PCTCN2018085645-appb-000126
Based on the fifth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000127
Among them, the fifth iteration calculation formula is
Figure PCTCN2018085645-appb-000128
among them,
Figure PCTCN2018085645-appb-000129
Is the log likelihood ratio mean at r; initializes the function value corresponding to α to
Figure PCTCN2018085645-appb-000130
Then at
Figure PCTCN2018085645-appb-000131
Based on the sixth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000132
Wherein, the sixth iteration calculation formula is
Figure PCTCN2018085645-appb-000133
It is mutual information at r; wherein, 1 ≤ m7 ≤ n3, 1 ≤ m8 ≤ n3, α1, α2, 2α and 2α-1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
需要说明的是，π 4(h)通过以下至少之一方式获取：π 4(h)＝BRO(h)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数h转换为第七二进制数(B n4-1,B n4-2,…,B 0)，将第七二进制数反序排列得到第八二进制数(B 0,B 1,…,B n4-1)，再将第八二进制数转换成十进制数得到π 4(h)，其中，n4＝log 2(R vb)，0≤h≤R vb-1；π 4(h)＝{S4,S5,S6}，其中，S4＝{0,1,…,h1-1}，S5＝{h2,h3,h2+1,h3+1,…,h4,h5}，S6为{0,1,…,R vb-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R vb/8≤h1≤h2≤R vb/3,h2≤h4≤h3≤2R vb/3,h3≤h5≤R vb-1，其中，h1、h2、h3、h4和h5均为正整数，且S4，S5与S6任意两者的交集为空集；π 4(h)＝{H}，其中，序列{H}中由M og的行索引β按照函数f(β)计算得到的数值结果升序或降序顺序排列得到，0≤β≤R vb-1，f(β)具有单调性；π 4(h)＝{O1,O2,O3},其中，O2＝{o1,o2,o1+1,o2+1,…,o3,o4}，其中0≤o1<o3≤(R vb-1)/2,0≤o2<o4≤(R vb-1)/2,o1,o2,o3和o4均为正整数,O1和O3为{0,1，…，R vb-1}与O2差集中的其他元素，且O1,O2,O3任意两者的交集为空集；在nVV1个相同位置上π 4(h)与预定义序列VV1的元素不同，其中 VV1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nVV1≤23；在nVV2个相同位置上π 4(h)与预定义序列VV2的元素不同，其中VV2＝{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}，0≤nVV2≤3。 It should be noted that π 4 (h) is obtained by at least one of the following methods: π 4 (h)=BRO(h), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number h Converted to a seventh binary number (B n4-1 , B n4-2 , ..., B 0 ), and the seventh binary number is arranged in reverse order to obtain an eighth binary number (B 0 , B 1 ,... , B n4-1 ), and then convert the eighth binary number into a decimal number to obtain π 4 (h), where n4=log 2 (R vb ), 0 ≤ h ≤ R vb -1; π 4 (h )={S4,S5,S6}, where S4={0,1,...,h1-1},S5={h2,h3,h2+1,h3+1,...,h4,h5},S6 is {0,1,..., R vb -1} is a set of elements other than the element contained in S4 and the element contained in S5, where R vb /8≤h1≤h2≤R vb /3, h2≤ H4≤h3≤2R vb /3, h3≤h5≤R vb -1, wherein h1, h2, h3, h4 and h5 are positive integers, and the intersection of any of S4, S5 and S6 is an empty set; π 4 (h)={H}, wherein the sequence {H} is obtained by ascending or descending order of the numerical results calculated by the function f(β) of the row index β of the M og , 0 ≤ β ≤ R vb -1, f (β) is monotone; π 4 (h) = { O1, O2, O3}, In, O2 = {o1, o2, o1 + 1, o2 + 1, ..., o3, o4}, where 0≤o1 <o3≤ (R vb -1) / 2,0≤o2 <o4≤ (R vb - 1) /2, o1, o2, o3 and o4 are positive integers, O1 and O3 are {0, 1, ..., R vb -1} and other elements in the O2 difference set, and any of O1, O2, O3 The intersection of the sets is an empty set; π 4 (h) is different from the elements of the predefined sequence VV1 at the same position of nVV, where VV1={0,1,2,3,4,5,6,7,8,9, 10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nVV1≤23 π 4 (h) is different from the elements of the predefined sequence VV2 at the same nVV 2 positions, where VV2={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}, 0 ≤ nVV2 ≤ 3.
需要说明的是，f(β)包括以下至少之一：
Figure PCTCN2018085645-appb-000134
(B n4-1,B n4-2,…,B 0)为索引β的二进制表示，0≤m9≤n4-1，n4＝log 2(R vb)，k为正整数；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000135
在
Figure PCTCN2018085645-appb-000136
的基础上按照第七迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000137
其中,第七迭代计算公式为
Figure PCTCN2018085645-appb-000138
其中，
Figure PCTCN2018085645-appb-000139
为r处的对数似然比均值；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000140
然后在
Figure PCTCN2018085645-appb-000141
的基础上按照第八迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000142
其中，第八迭代计算公式为
Figure PCTCN2018085645-appb-000143
为r处的互信息；其中，1≤m10≤n4，1≤m11≤n4，β1,β2,2β和2β-1均为大于或者等于0且小于或者等于R vb-1的整数。 It should be noted that f(β) includes at least one of the following:
Figure PCTCN2018085645-appb-000134
(B n4-1 , B n4-2 , ..., B 0 ) is a binary representation of the index β, 0 ≤ m9 ≤ n4-1, n4 = log 2 (R vb ), k is a positive integer; a function corresponding to β The value is initialized to
Figure PCTCN2018085645-appb-000135
in
Figure PCTCN2018085645-appb-000136
Based on the seventh iteration formula for n4 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000137
Wherein, the seventh iteration calculation formula is
Figure PCTCN2018085645-appb-000138
among them,
Figure PCTCN2018085645-appb-000139
Is the log likelihood ratio mean at r; initializes the function value corresponding to β to
Figure PCTCN2018085645-appb-000140
Then at
Figure PCTCN2018085645-appb-000141
Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000142
Among them, the eighth iteration calculation formula is
Figure PCTCN2018085645-appb-000143
It is mutual information at r; wherein, 1 ≤ m10 ≤ n4, 1 ≤ m11 ≤ n4, β1, β2, 2β and 2β-1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
需要说明的是，对于π 3(g),π 4(h)的解释，参考π 1(i),此处不再赘述。 It should be noted that for the explanation of π 3 (g) and π 4 (h), reference is made to π 1 (i), and details are not described herein again.
在本申请的一个实施例中，通过第二索引矩阵得到M_index包括：从M re中按行或按列或按对角方式选取预定数量的索引，将预定数量的索引作为M_index。 In an embodiment of the present application, obtaining the M_index by the second index matrix includes: selecting a predetermined number of indexes from the M re by row or column or diagonally, and taking a predetermined number of indexes as M_index.
本申请一实施方式中，从M re中按列选取预定数量的索引包括：从M re中第p列选取K p个索引，其中，
Figure PCTCN2018085645-appb-000144
p为整数，且1≤p≤C re；从M re中按行选取预定数量的索引包括：从M re中第q行选取K q个索引，其中，
Figure PCTCN2018085645-appb-000145
q为整数，且1≤q≤R re；从M re中按对角方式选取预定数 量的索引包括：从M re中第δ条对角线上选取K δ个索引，其中，
Figure PCTCN2018085645-appb-000146
δ为整数，且-min(R re,C re)+1≤δ≤max(R re,C re)-1；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 In an embodiment of the present application, selecting a predetermined number of indexes from the M re by the column includes: selecting K p indexes from the p- th column in the M re , wherein,
Figure PCTCN2018085645-appb-000144
p is an integer, and 1≤p≤C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein
Figure PCTCN2018085645-appb-000145
q is an integer, and 1 ≤ q ≤ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K δ indexes from the diagonal line of the δth line in M re , wherein
Figure PCTCN2018085645-appb-000146
δ is an integer, and -min(R re , C re )+1≤δ≤max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
本申请一实施方式中，从M re中按列选取预定数量的索引包括以下至少之一：从M re中依次从第1,2，…,C 1列选择K ic1个索引，其中
Figure PCTCN2018085645-appb-000147
1≤ic1≤C 1，1≤C 1≤C re，ic1和C 1为整数；从M re中依次从第C 2,C 2+1，…,C 3列选择K ic2个索引，其中
Figure PCTCN2018085645-appb-000148
C 2≤ic2≤C 3，1≤C 2≤C 3≤C re，ic2，C 2和C 3为整数；从M re中依次从第C 4,C 4+1，…,C re列选择K ic3个索引得到的，其中
Figure PCTCN2018085645-appb-000149
C 4≤ic3≤C re，1≤C 4≤C re，ic3和C 4为整数。 In an embodiment of the present application, selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein
Figure PCTCN2018085645-appb-000147
1 ≤ ic1 ≤ C 1 , 1 ≤ C 1 ≤ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein
Figure PCTCN2018085645-appb-000148
C 2 ≤ ic2 ≤ C 3 , 1 ≤ C 2 ≤ C 3 ≤ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which
Figure PCTCN2018085645-appb-000149
C 4 ≤ic3≤C re, 1≤C 4 ≤C re, ic3 and C 4 are integers.
本申请一实施方式中，从M re中按行选取预定数量的索引以下至少之一：从M re中依次从第1,2，…,R 1行选择K ir1个索引，其中
Figure PCTCN2018085645-appb-000150
1≤ir1≤R 1，1≤R 1≤R re，ir1和R 1为整数；从M re中依次从第R 2,R 2+1，…,R 3行选择K ir2个索引，其中
Figure PCTCN2018085645-appb-000151
R 2≤ir2≤R 3，1≤R 2≤R 3≤R re，ir2，R 2和R 3为整数；从M re中依次从第R 4,R 4+1，…,R re行选择K ir3个索引，其中
Figure PCTCN2018085645-appb-000152
1≤R 4≤R re，ir3和R 4为整数。 In an embodiment of the present application, at least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein
Figure PCTCN2018085645-appb-000150
1 ≤ ir1 ≤ R 1 , 1 ≤ R 1 ≤ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein
Figure PCTCN2018085645-appb-000151
R 2 ≤ ir2 ≤ R 3 , 1 ≤ R 2 ≤ R 3 ≤ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which
Figure PCTCN2018085645-appb-000152
1 ≤ R 4 ≤ R re , and ir3 and R 4 are integers.
本申请一实施方式中，从M re中按对角方式选取预定数量的索引包括以下至少之一：从M re中依次从第-min(R re,C re)+1,-min(R re,C re)+2，…,D 1条对角线选择K id1个索引，其中
Figure PCTCN2018085645-appb-000153
-min(R re,C re)+1≤D 1≤max(R re,C re)-1，id1和D 1为整数；从M re中依次从第D 2,D 2+1，…,D 3条对角线选择K id2个索引，其中
Figure PCTCN2018085645-appb-000154
-min(R re,C re)+1≤D 2≤D 3≤max(R re,C re)-1，id2，D 2和D 3为整数；从M re中依次从第D 4,D 4+1，…,max(R re,C re)-1条对角线选择K id3个索引，其中
Figure PCTCN2018085645-appb-000155
-min(R re,C re)+1≤D 4≤max(R re,C re)-1，id3和D 4为整数；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 In an embodiment of the present application, selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where
Figure PCTCN2018085645-appb-000153
-min(R re , C re )+1≤D 1 ≤max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which
Figure PCTCN2018085645-appb-000154
-min(R re , C re )+1≤D 2 ≤D 3 ≤max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonally select K id3 indexes, of which
Figure PCTCN2018085645-appb-000155
-min(R re , C re )+1≤D 4 ≤max(R re ,C re )-1, id3 and D 4 are integers; wherein min(R re , C re ) denotes R re and C re The minimum of the two, max(R re , C re ), represents the maximum of both R re and C re .
需要说明的是，以矩阵M为例，若M为方阵，也就是列数cc等于行数rr，若所述第0条对角线为主对角线，则与主对角线平行，往上依次是第1，2,…,rr-1条对角线，与主对角线平行，往下依次是第-1，-2,…,-rr+1条对角线；若所述第0条对角线为副对角线，则与副对角线平行，往上依次是第1，2,…,rr-1条对角线，与副对角线平行，往下依次是第-1，-2,…,-rr+1条对角线；It should be noted that, taking the matrix M as an example, if M is a square matrix, that is, the number of columns cc is equal to the number of rows rr, if the diagonal of the 0th line is the main diagonal, it is parallel to the main diagonal. Upward is the first, second, ..., rr-1 diagonal lines, parallel to the main diagonal, followed by the -1, -2, ..., -rr+1 diagonal lines; The diagonal of the 0th line is the diagonal of the sub-diagonal line, which is parallel to the sub-diagonal line, and the first, second, ..., rr-1 diagonal lines are in the order of the diagonal, parallel to the sub-diagonal line, and sequentially Is the -1, -2, ..., -rr+1 diagonal;
需要说明的是，以矩阵M为例，若矩阵M不是方阵，列数cc大于行数rr，以矩阵
Figure PCTCN2018085645-appb-000156
为例，若所述第0条对角线由元素a 1,cc和元素a rr,cc-rr+1连接而成，则与第0条对角线平行，往上依次是第1，2,…,cc-1条对角线，往下依次是第-1，-2,…,-rr+1条对角线；若所述第0条对角线为由元素a 1,1和元素a rr,rr连接而成，则与之平行，往上依次是第1，2,…,cc-1条对角线，往下依次是第-1，-2,…,-rr+1条对角线； It should be noted that, taking the matrix M as an example, if the matrix M is not a square matrix, the number of columns cc is greater than the number of rows rr, and the matrix
Figure PCTCN2018085645-appb-000156
For example, if the diagonal of the 0th line is formed by the element a 1, cc and the elements a rr, cc-rr+1 , it is parallel to the diagonal of the 0th line, and the first is the first and the second. ,..., cc-1 diagonal lines, followed by -1, -2, ..., -rr+1 diagonal lines; if the 0th diagonal is composed of elements a 1,1 and The elements a rr, rr are connected, parallel to them, up to the first, 2, ..., cc-1 diagonal lines, followed by the first -1, -2, ..., -rr+1 Diagonal
需要说明的是，若矩阵M不是方阵，行数rr大于列数cc，以矩阵
Figure PCTCN2018085645-appb-000157
为例，其中，若所述第0条对角线由元素a rr,1和元素a rr-cc+1,cc连接而成，则与之平行，往上依次是第1，2,…,rr-1条对角线，往下依次是第-1，-2,…,-cc+1条对角线；若所述第0条对角线为由元素a rr-cc+1,1和元素a rr,cc连接而成，则与之平行，往上依次是第1，2,…,rr-1条对角线，往下依次是第-1，-2,…,-cc+1条对角线。 It should be noted that if the matrix M is not a square matrix, the number of rows rr is greater than the number of columns cc, in a matrix.
Figure PCTCN2018085645-appb-000157
For example, if the diagonal of the 0th line is formed by the element a rr, 1 and the element a rr-cc+1, cc , it is parallel, and the first is the first, 2, ..., Rr-1 diagonal lines, followed by the -1, -2, ..., -cc+1 diagonal lines; if the 0th diagonal is the element a rr-cc+1, 1 Connected with the elements a rr, cc , parallel to it, up to the first, 2, ..., rr-1 diagonal lines, followed by the first -1, -2, ..., -cc+ 1 diagonal.
需要说明的是，在从M re中按行或按列或按对角方式选取预定数量的索引的过程中，跳过第二比特序列矩阵中未发送比特序列对应的索引，其中，所述第二比特序列矩阵为第一比特序列矩阵进行第二预定变换得到的，所述第一比特序列矩阵为所述极化码编码后比特序列组成，其中，所述第二预定变换包括：行置换或者列置换。 It should be noted that, in the process of selecting a predetermined number of indexes by row or column or diagonally from M re , skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
需要说明的是，若编码后比特序列为{x 0,x 1,x 2,…,x 15}，且待发送比特序列为{x 6,x 7,…,x 15}，则未发送比特序列对应的索引为{0,1,2,..,5}，而从M re中选择M_index中的索引时，应该跳过索引{0,1,2,..,5}。 It should be noted that if the encoded bit sequence is {x 0 , x 1 , x 2 , . . . , x 15 }, and the bit sequence to be transmitted is {x 6 , x 7 , . . . , x 15 }, the bit is not transmitted. The index corresponding to the sequence is {0, 1, 2, .., 5}, and when selecting the index in M_index from M re , the index {0, 1, 2, .., 5} should be skipped.
需要说明的是，从第二比特序列矩阵中选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列。It should be noted that selecting T bits from the second bit sequence matrix as the to-be-transmitted bit sequence includes: sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence. .
需要说明的是，从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列包括：从第二比特序列矩阵中的起始位置t开始，按行或按列或按对角方式从第二比特序列矩阵中依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到第二比特序列矩阵中的最后一个比特或第一个比特继续选取，1≤t≤R vb×C vb。 It should be noted that sequentially selecting T bits from the second bit sequence matrix by row or column or diagonally as the to-be-transmitted bit sequence includes starting from the starting position t in the second bit sequence matrix, according to the row. Or sequentially selecting T bits from the second bit sequence matrix in a column or diagonal manner, wherein when the first bit or the last bit in the second bit sequence matrix is selected, jumping to the second bit sequence matrix The last bit or the first bit in the continuation is selected, 1 ≤ t ≤ R vb × C vb .
需要说明的是，从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列包括：在T小于或者等于极化码编码后比特序列的长度N时，按列依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按行依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按对角方式依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T大于极化码编码后比特序列的长度N时，从第二比特序 列矩阵中第t个比特开始，按行或按列或按对角方式依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到最后一个比特或者第一个比特继续选取，其中，1≤t≤R vb×C vb；其中，N为正整数。 It should be noted that, in the second bit sequence matrix, T bits are sequentially selected as a to-be-transmitted bit sequence by row or column or diagonally, including: when T is less than or equal to the length N of the bit sequence after the polarization code is encoded. The first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in columns; when T is less than or equal to the length N of the bit sequence after the polarization code is encoded, the rows are sequentially Selecting 1st to Tth bits or N-T+1th to Nth bits in the second bit sequence matrix; when T is less than or equal to the length N of the bit sequence after the polarization code encoding, the first step is selected in a diagonal manner 1st to Tth bits or N-T+1 to N bits in the two-bit sequence matrix; when T is greater than the length N of the bit sequence after polarization code encoding, the tth bit from the second bit sequence matrix Initially, T bits are sequentially selected by row or column or diagonally, wherein when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit is skipped. Continue to select, where 1≤t≤R vb ×C vb ; N is a positive integer.
需要说明的是，从第二比特序列矩阵中按列依次选取T个比特包括以下至少之一：依次从第1,2，…,E 1列选择T ie1个比特，其中，
Figure PCTCN2018085645-appb-000158
1≤E 1≤C vb，ie1和E 1为整数；依次从第E 2,E 2+1，…,E 3列选择T ie2个比特，其中
Figure PCTCN2018085645-appb-000159
1≤E 2≤E 3≤C re，ie2，E 2和E 3为整数；依次从第E 4,E 4+1，…,E vb列选择T ie3个比特，其中
Figure PCTCN2018085645-appb-000160
1≤E 4≤C vb，ie3和E 4为整数。 Incidentally, the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein
Figure PCTCN2018085645-appb-000158
1 ≤ E 1 ≤ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein
Figure PCTCN2018085645-appb-000159
1 ≤ E 2 ≤ E 3 ≤ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein
Figure PCTCN2018085645-appb-000160
1 ≤ E 4 ≤ C vb , ie3 and E 4 are integers.
需要说明的是，从第二比特序列矩阵中按行依次选取T个比特包括以下至少之一：依次从第1,2，…,F 1行选择T if1个比特，其中
Figure PCTCN2018085645-appb-000161
1≤F 1≤R vb，if1和F 1为整数；依次从第F 2,F 2+1，…,F 3行选择T if2个比特，其中
Figure PCTCN2018085645-appb-000162
1≤F 2≤F 3≤R vb，if2，F 2和F 3为整数；依次从第F 4,F 4+1，…,R vb行选择T if3个比特，其中
Figure PCTCN2018085645-appb-000163
1≤F 4≤R vb，if3和F 4为整数。 It should be noted that selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein
Figure PCTCN2018085645-appb-000161
1 ≤ F 1 ≤ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein
Figure PCTCN2018085645-appb-000162
1≤F 2 ≤F 3 ≤R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein
Figure PCTCN2018085645-appb-000163
1 ≤ F 4 ≤ R vb , if3 and F 4 are integers.
需要说明的是，从第二比特序列矩阵中按对角方式依次选取T个比特包括以下至少之一：依次从第-min(R vb,C re)+1,-min(R vb,C vb)+2，…,G 1条对角线选择T ig1个比特，其中，
Figure PCTCN2018085645-appb-000164
-min(R vb,C vb)+1≤G 1≤max(R vb,C vb)-1，ig1和G 1为整数；依次从第G 2,G 2+1，…,G 3条对角线选择K ig2个比特，其中
Figure PCTCN2018085645-appb-000165
-min(R vb,C vb)+1≤G 2≤G 3≤max(R vb,C vb)-1，ig2，G 2和G 3为整数；依次从第G 4,G 4+1，…,max(R vb,C vb)-1条对角线选择K id3个比特，其中
Figure PCTCN2018085645-appb-000166
-min(R vb,C vb)+1≤G 4≤max(R vb,C vb)-1，ig3和G 4为整数。 It should be noted that T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where
Figure PCTCN2018085645-appb-000164
-min(R vb , C vb ) +1 ≤ G 1 ≤ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which
Figure PCTCN2018085645-appb-000165
-min(R vb , C vb )+1≤G 2 ≤G 3 ≤max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally select K id3 bits, of which
Figure PCTCN2018085645-appb-000166
-min(R vb , C vb )+1≤G 4 ≤max(R vb , C vb )-1, ig3 and G 4 are integers.
以下举例说明，若M vb中比特序列排列方式如下，
Figure PCTCN2018085645-appb-000167
T＝9：假若按行依次选取前9个比特组成待发送比特序列就是选取{y 0,y 1,y 2,y 3,y 4,y 5,y 6,y 7,y 8}组成待发送比特序列；假若按列依次选取前9个比特组成待发送比特序列就是选取{y 0,y 4,y 8,y 12,y 1,y 5,y 9,y 13,y 3}组成待发送比特序列；假若按对角依次选取前9个比特组成待发送比特序列就是选取{y 0,y 1,y 4,y 2,y 5,y 8,y 3,y 6,y 9}组成待发送比特序列；假若按行依次选取后9个比特组成待发送比特序列就是选取{y 7,y 8,y 9,y 10,y 11,y 12,y 13,y 14,y 15}组成待发送比特序列；假若按列依次选取后9个比特组成待发送比特序列就是选取{y 13,y 2,y 6,y 10,y 14,y 3,y 7,y 11,y 15}组成待发送比特序列；假若对角方式依次选取后9个比特组成待发送比特序列就是选取{y 6,y 9,y 12,y 7,y 10,y 13,y 11,y 14,y 15}组成待发送比特序列。顺序选取时，若选取到M vb最后一个比特y 15，则跳转到M vb第一个比特y 0继续选取；逆序选取时，若选取到M vb第一个比特y 0，则跳转到M vb最后一个比特y 15继续选取。 The following example shows that if the bit sequence in M vb is arranged as follows,
Figure PCTCN2018085645-appb-000167
T=9: If the first 9 bits are selected in order to form the bit sequence to be transmitted, then {y 0 , y 1 , y 2 , y 3 , y 4 , y 5 , y 6 , y 7 , y 8 } are selected. Sending a bit sequence; if the first 9 bits are sequentially arranged in columns to form a bit sequence to be transmitted, it is selected to be {y 0 , y 4 , y 8 , y 12 , y 1 , y 5 , y 9 , y 13 , y 3 } Send a bit sequence; if the first 9 bits are selected in a diagonal direction to form a bit sequence to be transmitted, it is composed of {y 0 , y 1 , y 4 , y 2 , y 5 , y 8 , y 3 , y 6 , y 9 } The bit sequence to be transmitted; if the 9 bits are sequentially selected in rows to form the bit sequence to be transmitted, it is composed of {y 7 , y 8 , y 9 , y 10 , y 11 , y 12 , y 13 , y 14 , y 15 } The bit sequence to be transmitted; if the 9 bits are sequentially selected in columns to form the bit sequence to be transmitted, it is composed of {y 13 , y 2 , y 6 , y 10 , y 14 , y 3 , y 7 , y 11 , y 15 } The bit sequence to be transmitted; if the diagonally arranged 9 bits are sequentially selected to form the bit sequence to be transmitted, {y 6 , y 9 , y 12 , y 7 , y 10 , y 13 , y 11 , y 14 , y 15 } are selected. The sequence of bits to be transmitted is composed. When the order is selected, if the last bit y 15 of M vb is selected, the jump to the first bit y 0 of M vb continues to be selected; when the reverse order is selected, if the first bit y 0 of M vb is selected, then jump to The last bit y 15 of M vb continues to be selected.
需要说明的是，上述步骤的执行主体可以为基站、终端，但并不限于此。It should be noted that the execution subject of the foregoing steps may be a base station or a terminal, but is not limited thereto.
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本申请各个实施例所述的方法。Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation. Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, The optical disc includes a number of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present application.
实施例2Example 2
在本实施例中还提供了一种序列确定装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。In the embodiment, a sequence determining device is further provided, which is used to implement the above-mentioned embodiments and preferred embodiments, and has not been described again. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
图3是根据本申请实施例的序列确定装置的结构框图，如图3所示，该装置包括：FIG. 3 is a structural block diagram of a sequence determining apparatus according to an embodiment of the present application. As shown in FIG. 3, the apparatus includes:
重排模块32，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；The rearrangement module 32 is configured to map the first bit sequence of length K bits to the designated position according to the M_index to obtain a second bit sequence;
编码模块34，与上述重排模块32连接，配置为将第二比特序列进行极化码编码，得到极化码编码后比特序列；The encoding module 34 is connected to the rearrangement module 32, and configured to perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code encoding;
选取模块36，与上述编码模块34连接，配置为从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T。The selecting module 36 is connected to the encoding module 34, and configured to select T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein K and T are positive integers, K≤T.
通过上述装置，根据索引序列M_index中的索引，将长度为K个比特的第一比特序列重新排列得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列，即本申请提供了一种待发送比特序列的确定方法，因而解决了上述相关技术中5G New RAT中没有相应的序列确定方法的问题。The first bit sequence of length K bits is rearranged according to the index in the index sequence M_index to obtain a second bit sequence. The second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding. The T bit is selected from the bit sequence after the polarization code encoding as the bit sequence to be transmitted, that is, the present application provides a method for determining the bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence in the 5G New RAT. Identify the problem with the method.
在本申请的一个实施例中，上述装置还可以包括：第一变换模块，与上述重排模块32连接，配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。即在极化码编码过程中，第一索引矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一索引矩阵的另 一维数即可，因此，可以在极化码的实现过程中，可以实现硬件的复用，因此，可以解决相关技术中极化码编码过程中硬件不能复用的问题。In an embodiment of the present application, the foregoing apparatus may further include: a first transform module, connected to the rearrangement module 32, configured to: pass the first index matrix to obtain a second index matrix by using a first predetermined transform; and pass the second index The matrix obtains M_index; wherein the first predetermined transform includes: row permutation or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
在本申请的一个实施例中，上述装置还包括：第二变换模块，与上述编码模块34连接，配置为将极化码编码后比特序列组成第一比特序列矩阵；将第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，第二预定变换包括：行置换或者列置换；选取模块，还配置为从第二比特序列矩阵中选取T个比特作为待发送比特序列。即第一比特序列矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一比特序列矩阵的另一维数即可，因而可以在极化码的实现过程中，可以进一步实现硬件的复用，因此，进一步解决相关技术中极化码编码过程中硬件不能复用的问题。In an embodiment of the present application, the apparatus further includes: a second transform module, coupled to the encoding module 34, configured to form a bit sequence of the first bit sequence matrix by encoding the bit code; and performing the first bit sequence matrix The second predetermined transform obtains a second bit sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted. That is, the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed. The multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
需要说明的是，上述装置还可以包括：存储模块，与上述第一变换模块连接，配置为存储第二比特序列矩阵。It should be noted that the foregoing apparatus may further include: a storage module, connected to the first transform module, configured to store a second bit sequence matrix.
需要说明的是，上述存储模块可以缓存，或者其他的存储器比如内存，或其他逻辑存在，但并不限于此。It should be noted that the foregoing storage module may be cached, or other memory such as memory, or other logic exists, but is not limited thereto.
需要说明的是，上述第一索引矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一索引矩阵为二维矩阵为例，上述同一维度的变换模式相同可以表现为：第一索引矩阵的行变换模式相同或者列变换模式相同。It should be noted that the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto. The first index matrix is a two-dimensional matrix, and the transformation mode of the same dimension is used. The same can be expressed as: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
以上述第一索引矩阵为二维矩阵为例，在本申请的一个实施例中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 Taking the first index matrix as a two-dimensional matrix as an example, in one embodiment of the present application, the second index matrix is M re , and M re is a matrix of R re rows C re columns, and the first index matrix is M or M or is
Figure PCTCN2018085645-appb-000168
或者，
Figure PCTCN2018085645-appb-000168
or,
Figure PCTCN2018085645-appb-000169
Figure PCTCN2018085645-appb-000169
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
需要说明的是，在R re不变的情况下，C re为满足R re×C re≥N的最小值；或者，在C re不变的情况下，R re为满足R re×C re≥N的最小值。 Incidentally, in the case where R re unchanged, C re is the minimum value satisfying R re × C re ≥N; or in the case of constant C re, R re to meet R re × C re ≥ The minimum value of N.
需要说明的是，上述第一变换模块还配置为通过以下至少之一得到第二索引矩阵：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 It should be noted that, the first transform module is further configured to obtain the second index matrix by at least one of the following: the ith column of M re is obtained by column permutation of the π 1 (i) column of M or , where, ≤i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; j-M or the behavior of M re of π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j and π 2 ( j) are positive integers.
需要说明的是，上述π 1(i)通过以下至少之一方式获取：方式一：π 1(i)＝BRO(i)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数i转换为第一二进制数(B n1-1,B n1-2,…,B 0)，将第一二进制数反序排列得到第二二进制数(B 0,B 1,…,B n1-1)，再将第二二进制数转换成十进制数得到π 1(i)，其中，n1＝log 2(C re)，0≤i≤C re-1；方式二：π 1(i)＝{S1,S2,S3}，其中，S1＝{0,1,…,i1-1}，S2＝{i2,i3,i2+1,i3+1,…,i4,i5}，S3为{0,1,…,C re-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C re/8≤i1≤i2≤C re/3,i2≤i4≤i3≤2C re/3,i3≤i5≤C re-1，其中，i1、i2、i3、i4和i5均为正整数，且S1，S2与S3任意两者的交集为空集；方式三：π 1(i)＝{I}，其中，序列{I}由M or的列索引r按照函数f(r)计算得到的数值结果升序或降序顺序排列得到，0≤r≤C re-1，f(r)具有单调性。 It should be noted that the above π 1 (i) is obtained by at least one of the following manners: mode 1: π 1 (i)=BRO(i), wherein BRO() represents a bit reverse sequence operation, and the bit reverse sequence operation includes: i decimal number into a first binary number (B n1-1, B n1-2, ... , B 0), the reverse order of the first binary number to obtain a second binary number (B 0, B 1 ,...,B n1-1 ), and then converting the second binary number into a decimal number to obtain π 1 (i), where n1=log 2 (C re ), 0≤i≤C re -1; Manner 2: π 1 (i)={S1, S2, S3}, where S1={0,1,...,i1-1},S2={i2,i3,i2+1,i3+1,..., I4, i5}, S3 is a set of {0, 1, ..., C re -1} except for the element included in S1 and the element included in S2, where C re /8 ≤ i1 ≤ i2 ≤ C re /3, i2 ≤ i4 ≤ i3 ≤ 2C re /3, i3 ≤ i5 ≤ C re -1, wherein i1, i2, i3, i4 and i5 are both positive integers, and any of S1, S2 and S3 The intersection of the set is an empty set; mode 3: π 1 (i)={I}, wherein the sequence {I} is arranged by the column index r of the M or the numerical result calculated by the function f(r) in ascending or descending order. 0≤r≤C re -1,f(r) has Monotonic.
以下举例说明上述三种方式：The following examples illustrate the above three methods:
对于方式一：若C re＝8，i＝6，则n1＝log 2(8)＝3，将i＝6转换成二进制数 (B 2,B 1,B 0)＝(1,1,0)，将所述二进制数(B 2,B 1,B 0)＝(1,1,0)反序排列得到(B 0,B 1,B 2)＝(0,1,1)，再将所述二进制数(B 0,B 1,B 2)＝(0,1,1)转换成十进制得到π 1(i)＝3。 For mode one: if C re =8, i=6, then n1=log 2 (8)=3, convert i=6 into binary number (B 2 , B 1 , B 0 )=(1,1,0 ), the binary numbers (B 2 , B 1 , B 0 )=(1,1,0) are arranged in reverse order to obtain (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ), and then The binary number (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ) is converted into decimal to obtain π 1 (i)=3.
对于方式二：若C re＝8，i 1＝2，i 2＝2，i 3＝4，i 4＝3，i 5＝5，则将S1＝{0,1}，S2＝{2,4,3,5}，S3＝{6,7}；π 1(i)＝{0,1,2,4,3,5,6,7}。 For mode two: If C re = 8, i 1 = 2, i 2 = 2, i 3 = 4, i 4 = 3, i 5 = 5, then S1 = {0, 1}, S2 = {2, 4,3,5}, S3={6,7}; π 1 (i)={0,1,2,4,3,5,6,7}.
对于方式三：C re＝8，{f(0),…,f(7)}＝{0,1,1.18,2.18,1.41,2.41,2.60,3.60}，将f(0),…,f(7)从小到大排列，则得到π 1(i)＝{1,2,3,5,4,6,7,8}。 For mode three: C re =8, {f(0),...,f(7)}={0,1,1.18,2.18,1.41,2.41, 2.60, 3.60}, f(0),...,f (7) From small to large, π 1 (i) = {1, 2, 3, 5, 4, 6, 7, 8} is obtained.
需要说明的是，f(r)包括以下至少之一：It should be noted that f(r) includes at least one of the following:
Figure PCTCN2018085645-appb-000170
(B n1-1,B n1-2,…,B 0)为索引r的二进制表示，0≤m1≤n1-1，n1＝log 2(C re)，k为正整数；比如：C re＝8，i＝6，k＝4，则n1＝log 2(8)＝3，将i＝6转换成二进制数(B 2,B 1,B 0)＝(1,1,0),
Figure PCTCN2018085645-appb-000171
Figure PCTCN2018085645-appb-000170
(B n1-1, B n1-2, ... , B 0) is the binary representation of the index r, 0≤m1≤n1-1, n1 = log 2 ( C re), k is a positive integer; for example: C re = 8, i=6, k=4, then n1=log 2 (8)=3, convert i=6 into a binary number (B 2 , B 1 , B 0 )=(1,1,0),
Figure PCTCN2018085645-appb-000171
将r对应的的函数值初始化为
Figure PCTCN2018085645-appb-000172
在
Figure PCTCN2018085645-appb-000173
的基础上按照第一迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000174
其中,第一迭代计算公式为
Figure PCTCN2018085645-appb-000175
其中，
Figure PCTCN2018085645-appb-000176
为r处的对数似然比均值；比如：
Figure PCTCN2018085645-appb-000177
可近似为
Figure PCTCN2018085645-appb-000178
参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000172
in
Figure PCTCN2018085645-appb-000173
Based on the first iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000174
Wherein, the first iteration calculation formula is
Figure PCTCN2018085645-appb-000175
among them,
Figure PCTCN2018085645-appb-000176
Is the log likelihood ratio mean at r; for example:
Figure PCTCN2018085645-appb-000177
Approximate
Figure PCTCN2018085645-appb-000178
The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000179
σ2为噪声方差，C re＝8，σ2＝0，将
Figure PCTCN2018085645-appb-000180
代入迭代公式，得到
Figure PCTCN2018085645-appb-000181
然后将
Figure PCTCN2018085645-appb-000182
代入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000183
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000184
而f(r)＝
Figure PCTCN2018085645-appb-000185
0≤r≤C re-1，,{f(0),…,f(7)}＝{0.04,0.41,0.61,3.29,1.00,4.56,5.78,16.00}； Assumed initial value
Figure PCTCN2018085645-appb-000179
Σ2 is the noise variance, C re =8, σ2=0, will
Figure PCTCN2018085645-appb-000180
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000181
followed by
Figure PCTCN2018085645-appb-000182
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000183
And so on, until the calculation is
Figure PCTCN2018085645-appb-000184
And f(r)=
Figure PCTCN2018085645-appb-000185
0 ≤ r ≤ C re -1,, {f(0), ..., f(7)} = {0.04, 0.41, 0.61, 3.29, 1.00, 4.56, 5.78, 16.00};
将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000186
然后在
Figure PCTCN2018085645-appb-000187
的基础上按照第二迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000188
其中，第二迭代计算公式为
Figure PCTCN2018085645-appb-000189
为r处的互信息；其中，1≤m2≤n1，1≤m3≤n1，r1,r2,2r和2r-1均为大于或者等于0且小于或者等于C re-1的整数；其中，参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000186
Then at
Figure PCTCN2018085645-appb-000187
Based on the second iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000188
Wherein, the second iteration calculation formula is
Figure PCTCN2018085645-appb-000189
Is the mutual information at r; wherein, 1 ≤ m2 ≤ n1, 1 ≤ m3 ≤ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1; The iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000190
C re＝8，将
Figure PCTCN2018085645-appb-000191
代入迭代公式，得到
Figure PCTCN2018085645-appb-000192
然后将
Figure PCTCN2018085645-appb-000193
代入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000194
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000195
而f(r)＝
Figure PCTCN2018085645-appb-000196
0≤i≤C re-1，{f(0),…,f(7)}＝{0.008,0.152,0.221,0.682,0.313,0.779,0.850,0.991}。 Assumed initial value
Figure PCTCN2018085645-appb-000190
C re =8, will
Figure PCTCN2018085645-appb-000191
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000192
followed by
Figure PCTCN2018085645-appb-000193
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000194
And so on, until the calculation is
Figure PCTCN2018085645-appb-000195
And f(r)=
Figure PCTCN2018085645-appb-000196
0 ≤ i ≤ C re -1, {f(0), ..., f(7)} = {0.008, 0.152, 0.221, 0.682, 0.313, 0.779, 0.850, 0.991}.
需要说明的是，上述π 2(j)通过以下至少之一方式获取：π 2(j)＝BRO(j)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数j转换为第三二进制数(B n2-1,B n2-2,…,B 0)，将第三二进制数反序排列得到第四二进制数(B 0,B 1,…,B n2-1)，再将第四二进制数转换成十进制数得到π 2(j)，其中，n2＝log 2(R re)，0≤j≤R re-1；π 2(j)＝{S4,S5,S6}，其中，S4＝{0,1,…,j1-1}，S5＝{j2,j3,j2+1,j3+1,…,j4,j5}，S6为{0,1,…,R re-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R re/8≤j1≤j2≤R re/3,j2≤j4≤j3≤2R re/3,j3≤j5≤R re-1，其中，j1、j2、j3、j4和j5均为正整数，且S4，S5与S6任意两者的交集为空集；π 2(j)＝{J}，其中，序列{J}中由M or的行索引s按照函数f(s)计算得到的数值结果升序或降序顺序排列得到，0≤s≤R re-1，f(s)具有单调性。 It should be noted that the above π 2 (j) is obtained by at least one of the following methods: π 2 (j)=BRO(j), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number j into a third binary number (B n2-1, B n2-2, ... , B 0), the third binary number in reverse order to obtain a fourth binary number (B 0, B 1, ..., B n2-1 ), and then convert the fourth binary number into a decimal number to obtain π 2 (j), where n2 = log 2 (R re ), 0 ≤ j ≤ R re -1; π 2 ( j)={S4, S5, S6}, where S4={0,1,...,j1-1}, S5={j2,j3,j2+1,j3+1,...,j4,j5},S6 A set consisting of elements other than the element contained in S4 and the element contained in S5 in {0, 1, ..., R re -1}, where R re /8 ≤ j1 ≤ j2 ≤ R re /3, j2 ≤ j4 ≤ j3 ≤ 2R re /3, j3 ≤ j5 ≤ R re -1, wherein j1, j2, j3, j4 and j5 are all positive integers, and the intersection of any of S4, S5 and S6 is an empty set; π 2 (j) = {J }, where the sequence {J} M or obtained by the row index s is calculated as a function f (s) results are arranged in ascending or descending order of values obtained, 0≤s≤R re -1 , f(s) is monotonic.
需要说明的是，f(s)包括以下至少之一：
Figure PCTCN2018085645-appb-000197
(B n2-1,B n2-2,…,B 0)为索引s的二进制表示，0≤m4≤n2-1，n2＝log 2(R re)，k为正整数；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000198
在
Figure PCTCN2018085645-appb-000199
的基础上按照第三迭代公 式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000200
其中,第三迭代计算公式为
Figure PCTCN2018085645-appb-000201
其中，
Figure PCTCN2018085645-appb-000202
为s处的对数似然比均值；将s的函数值初始化为
Figure PCTCN2018085645-appb-000203
然后在
Figure PCTCN2018085645-appb-000204
的基础上按照第四迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000205
其中，第四迭代计算公式为
Figure PCTCN2018085645-appb-000206
其中，
Figure PCTCN2018085645-appb-000207
为s处的互信息；其中，1≤m5≤n2，1≤m6≤n2，s1,s2,2s和2s-1均为大于或者等于0且小于或者等于R re-1的整数。 It should be noted that f(s) includes at least one of the following:
Figure PCTCN2018085645-appb-000197
(B n2-1, B n2-2, ... , B 0) is the binary representation of the index s, 0≤m4≤n2-1, n2 = log 2 ( R re), k is a positive integer; s function corresponding The value is initialized to
Figure PCTCN2018085645-appb-000198
in
Figure PCTCN2018085645-appb-000199
Based on the third iteration formula, after n2 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000200
Wherein, the third iteration calculation formula is
Figure PCTCN2018085645-appb-000201
among them,
Figure PCTCN2018085645-appb-000202
Is the log likelihood ratio mean at s; initializes the function value of s to
Figure PCTCN2018085645-appb-000203
Then at
Figure PCTCN2018085645-appb-000204
Based on the fourth iteration formula, n2 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000205
Wherein, the fourth iteration calculation formula is
Figure PCTCN2018085645-appb-000206
among them,
Figure PCTCN2018085645-appb-000207
Is the mutual information at s; wherein, 1 ≤ m5 ≤ n2, 1 ≤ m6 ≤ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
需要说明的是，上述对于π 2(j)的解释，参考π 1(i)的解释。 It should be noted that the above explanation for π 2 (j) refers to the explanation of π 1 (i).
需要说明的是，上述第一比特序列矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一比特序列矩阵为二维矩阵为例，上述同一维度的变换模式相同可以表现为：第一比特序列矩阵的行变换模式相同或者列变换模式相同。It should be noted that the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto, and the first bit sequence matrix is taken as a two-dimensional matrix, for example, the same dimension The same transformation mode can be expressed as follows: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
需要说明的是，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 It should be noted that the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000208
或者，
Figure PCTCN2018085645-appb-000208
or,
Figure PCTCN2018085645-appb-000209
Figure PCTCN2018085645-appb-000209
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000210
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000210
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
需要说明的是，在R vb不变的情况下，C vb为满足R vb×C vb≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N的最小值。 Incidentally, in the case where the constant R vb, C vb is the minimum value satisfying R vb × C vb ≥N; or in the case of constant C vb, R vb is satisfied R vb × C vb ≥ The minimum value of N.
需要说明的是，上述第二变换模块还配置为通过以下至少之一得到第二比特序列矩阵：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 Incidentally, the second conversion module is further configured to obtain a second bit sequence by at least one of the following matrix: M vb first ranked π M og g of 3 (g) after column permutation obtained column, wherein 0≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; h behavior of the M og M vb of π 4 (h) obtained after the row permutation of the rows, wherein, 0≤h≤R vb -1,0≤π 4 (h) ≤R vb -1, R vb × C vb ≥N, h and π 4 (h) are positive integers.
需要说明的是，π 3(g)通过以下至少之一方式获取：π 3(g)＝BRO(g)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数g转换为第五二进制数(B n3-1,B n3-2,…,B 0)，将第五二进制数反序排列得到第六二进制数(B 0,B 11,…,B n3-1)，再将第六二进制数转换成十进制数得到π 3(g)，其中，n3＝log 2(C vb)，0≤g≤C vb-1；π 3(g)＝{S1,S2,S3}，其中，S1＝{0,1,…,g1-1}，S2＝{g2,g3,g2+1,g3+1,…,g4,g5}，S3为{0,1,…,C vb-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C vb/8≤g1≤g2≤C vb/3,g2≤g4≤g3≤2C vb/3,g3≤g5≤C vb-1，其中，g1、g2、g3、g4和g5均为正整数，且S1，S2与S3任意两者的交集为空集；π 3(g)＝{G}，其中，序列{G}由M og的列索引α按照函数f(α)计算得到的数值结果升序或降序顺序排列得到，0≤α≤C vb-1，f(α)具有单调性；π 3(g)＝{Q1,Q2,Q3},其中，Q2＝{q1,q2,q1+1,q2+1,…,q3,q4}，其中0≤q1<q3≤(C vb-1)/2,0≤q2<q4≤(C vb-1)/2,q1,q2,q3和q4均为正整数,Q1和Q3为{0,1，…，C vb-1}与Q2差集中的其他元素，且Q1,Q2,Q3任意两者的交集为空集；在nV1个相同位置上π 3(g)与预定义序列V1的元素不同，其中，V1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nV1≤23；在nV2个相同位置上π 3(g)与预定义序列V2的元素不同，其中，V2＝{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}，0≤nV2≤ 3。 It should be noted that π 3 (g) is obtained by at least one of the following: π 3 (g)=BRO(g), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number g Converted to a fifth binary number (B n3-1 , B n3-2 , ..., B 0 ), and the fifth binary number is arranged in reverse order to obtain a sixth binary number (B 0 , B 11 ,... , B n3-1 ), and then convert the sixth binary number into a decimal number to obtain π 3 (g), where n3=log 2 (C vb ), 0≤g≤C vb -1; π 3 (g )={S1,S2,S3}, where S1={0,1,...,g1-1},S2={g2,g3,g2+1,g3+1,...,g4,g5},S3 is {0,1,..., C vb -1} A set of elements other than the element contained in S1 and the element contained in S2, wherein C vb /8 ≤ g1 ≤ g2 ≤ C vb / 3, g2 ≤ G4 ≤ g3 ≤ 2C vb /3, g3 ≤ g5 ≤ C vb -1, wherein g1, g2, g3, g4 and g5 are all positive integers, and the intersection of any of S1, S2 and S3 is an empty set; π 3 (g)={G}, where the sequence {G} is arranged in ascending or descending order by the numerical result calculated by the function f(α) of the column index α of the M og , 0 ≤ α ≤ C vb -1, f (α) has monotonicity; π 3 (g) = {Q1, Q2, Q3}, which Where Q2={q1,q2,q1+1,q2+1,...,q3,q4}, where 0≤q1<q3≤(C vb -1)/2,0≤q2<q4≤(C vb - 1) /2, q1, q2, q3 and q4 are positive integers, Q1 and Q3 are {0, 1, ..., C vb -1} and other elements in the Q2 difference set, and any of Q1, Q2, Q3 The intersection is an empty set; π 3 (g) is different from the element of the predefined sequence V1 at the same position of nV1, where V1={0,1,2,3,4,5,6,7,8,9 ,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nV1≤ 23; π 3 (g) is different from the element of the predefined sequence V2 at the same position of nV2, where V2={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}, 0 ≤ nV2 ≤ 3.
需要说明的是，f(α)包括以下至少之一：
Figure PCTCN2018085645-appb-000211
(B n3-1,B n3-2,…,B 0)为索引α的二进制表示，0≤m6≤n3-1，n3＝log 2(C vb)，k为正整数；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000212
在
Figure PCTCN2018085645-appb-000213
的基础上按照第五迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000214
其中,第五迭代计算公式为
Figure PCTCN2018085645-appb-000215
其中，
Figure PCTCN2018085645-appb-000216
为r处的对数似然比均值；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000217
然后在
Figure PCTCN2018085645-appb-000218
的基础上按照第六迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000219
其中，第六迭代计算公式为
Figure PCTCN2018085645-appb-000220
为r处的互信息；其中，1≤m7≤n3，1≤m8≤n3，α1,α2,2α和2α-1均为大于或者等于0且小于或者等于C vb-1的整数。 It should be noted that f(α) includes at least one of the following:
Figure PCTCN2018085645-appb-000211
(B n3-1 , B n3-2 , ..., B 0 ) is a binary representation of the index α, 0 ≤ m6 ≤ n3-1, n3 = log 2 (C vb ), k is a positive integer; a function corresponding to α The value is initialized to
Figure PCTCN2018085645-appb-000212
in
Figure PCTCN2018085645-appb-000213
Based on the fifth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000214
Among them, the fifth iteration calculation formula is
Figure PCTCN2018085645-appb-000215
among them,
Figure PCTCN2018085645-appb-000216
Is the log likelihood ratio mean at r; initializes the function value corresponding to α to
Figure PCTCN2018085645-appb-000217
Then at
Figure PCTCN2018085645-appb-000218
Based on the sixth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000219
Wherein, the sixth iteration calculation formula is
Figure PCTCN2018085645-appb-000220
It is mutual information at r; wherein, 1 ≤ m7 ≤ n3, 1 ≤ m8 ≤ n3, α1, α2, 2α and 2α-1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
需要说明的是，π 4(h)通过以下至少之一方式获取：π 4(h)＝BRO(h)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数h转换为第七二进制数(B n4-1,B n4-2,…,B 0)，将第七二进制数反序排列得到第八二进制数(B 0,B 1,…,B n4-1)，再将第八二进制数转换成十进制数得到π 4(h)，其中，n4＝log 2(R vb)，0≤h≤R vb-1；π 4(h)＝{S4,S5,S6}，其中，S4＝{0,1,…,h1-1}，S5＝{h2,h3,h2+1,h3+1,…,h4,h5}，S6为{0,1,…,R vb-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R vb/8≤h1≤h2≤R vb/3,h2≤h4≤h3≤2R vb/3,h3≤h5≤R vb-1，其中，h1、h2、h3、h4和h5均为正整数，且S4，S5与S6任意两者的交集为空集；π 4(h)＝{H}，其中，序列{H}中由M og的行索引β按照函数f(β)计算得到的数值结果升序或降序顺序排列得到，0≤β≤R vb-1，f(β)具有单调性；π 4(h)＝{O1,O2,O3},其中，O2＝{o1,o2,o1+1,o2+1,…,o3,o4}，其中0≤o1<o3≤(R vb-1)/2,0≤o2<o4≤ (R vb-1)/2,o1,o2,o3和o4均为正整数,O1和O3为{0,1，…，R vb-1}与O2差集中的其他元素，且O1,O2,O3任意两者的交集为空集；在nVV1个相同位置上π 4(h)与预定义序列VV1的元素不同，其中VV1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nVV1≤23；在nVV2个相同位置上π 4(h)与预定义序列VV2的元素不同，其中VV2＝{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}，0≤nVV2≤3。 It should be noted that π 4 (h) is obtained by at least one of the following methods: π 4 (h)=BRO(h), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number h Converted to a seventh binary number (B n4-1 , B n4-2 , ..., B 0 ), and the seventh binary number is arranged in reverse order to obtain an eighth binary number (B 0 , B 1 ,... , B n4-1 ), and then convert the eighth binary number into a decimal number to obtain π 4 (h), where n4=log 2 (R vb ), 0 ≤ h ≤ R vb -1; π 4 (h )={S4,S5,S6}, where S4={0,1,...,h1-1},S5={h2,h3,h2+1,h3+1,...,h4,h5},S6 is {0,1,..., R vb -1} is a set of elements other than the element contained in S4 and the element contained in S5, where R vb /8≤h1≤h2≤R vb /3, h2≤ H4≤h3≤2R vb /3, h3≤h5≤R vb -1, wherein h1, h2, h3, h4 and h5 are positive integers, and the intersection of any of S4, S5 and S6 is an empty set; π 4 (h)={H}, wherein the sequence {H} is obtained by ascending or descending order of the numerical results calculated by the function f(β) of the row index β of the M og , 0 ≤ β ≤ R vb -1, f (β) is monotone; π 4 (h) = { O1, O2, O3}, In, O2 = {o1, o2, o1 + 1, o2 + 1, ..., o3, o4}, where 0≤o1 <o3≤ (R vb -1) / 2,0≤o2 <o4≤ (R vb - 1) /2, o1, o2, o3 and o4 are positive integers, O1 and O3 are {0, 1, ..., R vb -1} and other elements in the O2 difference set, and any of O1, O2, O3 The intersection of the sets is an empty set; π 4 (h) is different from the elements of the predefined sequence VV1 at the same position of nVV, where VV1={0,1,2,3,4,5,6,7,8,9, 10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nVV1≤23 π 4 (h) is different from the elements of the predefined sequence VV2 at the same nVV 2 positions, where VV2={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}, 0 ≤ nVV2 ≤ 3.
需要说明的是，f(β)包括以下至少之一：
Figure PCTCN2018085645-appb-000221
(B n4-1,B n4-2,…,B 0)为索引β的二进制表示，0≤m9≤n4-1，n4＝log 2(R vb)，k为正整数；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000222
在
Figure PCTCN2018085645-appb-000223
的基础上按照第七迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000224
其中,第七迭代计算公式为
Figure PCTCN2018085645-appb-000225
其中，
Figure PCTCN2018085645-appb-000226
为r处的对数似然比均值；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000227
然后在
Figure PCTCN2018085645-appb-000228
的基础上按照第八迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000229
其中，第八迭代计算公式为
Figure PCTCN2018085645-appb-000230
为r处的互信息；其中，1≤m10≤n4，1≤m11≤n4，β1,β2,2β和2β-1均为大于或者等于0且小于或者等于R vb-1的整数。 It should be noted that f(β) includes at least one of the following:
Figure PCTCN2018085645-appb-000221
(B n4-1 , B n4-2 , ..., B 0 ) is a binary representation of the index β, 0 ≤ m9 ≤ n4-1, n4 = log 2 (R vb ), k is a positive integer; a function corresponding to β The value is initialized to
Figure PCTCN2018085645-appb-000222
in
Figure PCTCN2018085645-appb-000223
Based on the seventh iteration formula for n4 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000224
Wherein, the seventh iteration calculation formula is
Figure PCTCN2018085645-appb-000225
among them,
Figure PCTCN2018085645-appb-000226
Is the log likelihood ratio mean at r; initializes the function value corresponding to β to
Figure PCTCN2018085645-appb-000227
Then at
Figure PCTCN2018085645-appb-000228
Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000229
Among them, the eighth iteration calculation formula is
Figure PCTCN2018085645-appb-000230
It is mutual information at r; wherein, 1 ≤ m10 ≤ n4, 1 ≤ m11 ≤ n4, β1, β2, 2β and 2β-1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
需要说明的是，对于π 3(g),π 4(h)的解释，参考π 1(i),此处不再赘述。 It should be noted that for the explanation of π 3 (g) and π 4 (h), reference is made to π 1 (i), and details are not described herein again.
在本申请的一个实施例中，上述第一变换模块还配置为从M re中按行或按列或按对角方式选取预定数量的索引，将预定数量的索引作为M_index。 In an embodiment of the present application, the first transform module is further configured to select a predetermined number of indexes from the M re by row or column or diagonally, and use a predetermined number of indexes as M_index.
需要说明的是，从M re中按列选取预定数量的索引包括：从M re中第p 列选取K p个索引，其中，
Figure PCTCN2018085645-appb-000231
p为整数，且1≤p≤C re；从M re中按行选取预定数量的索引包括：从M re中第q行选取K q个索引，其中，
Figure PCTCN2018085645-appb-000232
q为整数，且1≤q≤R re；从M re中按对角方式选取预定数量的索引包括：从M re中第δ条对角线上选取K δ个索引，其中，
Figure PCTCN2018085645-appb-000233
δ为整数，且-min(R re,C re)+1≤δ≤max(R re,C re)-1；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 Incidentally, by selecting a predetermined number of columns from M re index comprises: selecting from the p-th column of M re index K p, wherein
Figure PCTCN2018085645-appb-000231
p is an integer, and 1≤p≤C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein
Figure PCTCN2018085645-appb-000232
q is an integer, and 1 ≤ q ≤ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K δ indexes from the diagonal line of the δth line in M re , wherein
Figure PCTCN2018085645-appb-000233
δ is an integer, and -min(R re , C re )+1≤δ≤max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
需要说明的是，从M re中按列选取预定数量的索引包括以下至少之一：从M re中依次从第1,2，…,C 1列选择K ic1个索引，其中
Figure PCTCN2018085645-appb-000234
1≤ic1≤C 1，1≤C 1≤C re，ic1和C 1为整数；从M re中依次从第C 2,C 2+1，…,C 3列选择K ic2个索引，其中
Figure PCTCN2018085645-appb-000235
C 2≤ic2≤C 3，1≤C 2≤C 3≤C re，ic2，C 2和C 3为整数；从M re中依次从第C 4,C 4+1，…,C re列选择K ic3个索引得到的，其中
Figure PCTCN2018085645-appb-000236
C 4≤ic3≤C re，1≤C 4≤C re，ic3和C 4为整数。 It should be noted that selecting a predetermined number of indexes from the column by M re includes at least one of the following: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein
Figure PCTCN2018085645-appb-000234
1 ≤ ic1 ≤ C 1 , 1 ≤ C 1 ≤ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein
Figure PCTCN2018085645-appb-000235
C 2 ≤ ic2 ≤ C 3 , 1 ≤ C 2 ≤ C 3 ≤ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which
Figure PCTCN2018085645-appb-000236
C 4 ≤ic3≤C re, 1≤C 4 ≤C re, ic3 and C 4 are integers.
需要说明的是，从M re中按行选取预定数量的索引以下至少之一：从M re中依次从第1,2，…,R 1行选择K ir1个索引，其中
Figure PCTCN2018085645-appb-000237
1≤ir1≤R 1，1≤R 1≤R re，ir1和R 1为整数；从M re中依次从第R 2,R 2+1，…,R 3行选择K ir2个索引，其中
Figure PCTCN2018085645-appb-000238
R 2≤ir2≤R 3，1≤R 2≤R 3≤R re，ir2，R 2和R 3为整数；从M re中依次从第R 4,R 4+1，…,R re行选择K ir3个索引，其中
Figure PCTCN2018085645-appb-000239
1≤R 4≤R re，ir3和R 4为整数。 It should be noted that at least one of the following number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are selected from the first, second, ..., R 1 rows, wherein
Figure PCTCN2018085645-appb-000237
1 ≤ ir1 ≤ R 1 , 1 ≤ R 1 ≤ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein
Figure PCTCN2018085645-appb-000238
R 2 ≤ ir2 ≤ R 3 , 1 ≤ R 2 ≤ R 3 ≤ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which
Figure PCTCN2018085645-appb-000239
1 ≤ R 4 ≤ R re , and ir3 and R 4 are integers.
需要说明的是，从M re中按对角方式选取预定数量的索引包括以下至少之一：从M re中依次从第-min(R re,C re)+1,-min(R re,C re)+2，…,D 1条对角线选择K id1个索引，其中
Figure PCTCN2018085645-appb-000240
-min(R re,C re)+1≤D 1≤max(R re,C re)-1，id1和D 1为整数；从M re中依次从第D 2,D 2+1，…,D 3条对 角线选择K id2个索引，其中
Figure PCTCN2018085645-appb-000241
-min(R re,C re)+1≤D 2≤D 3≤max(R re,C re)-1，id2，D 2和D 3为整数；从M re中依次从第D 4,D 4+1，…,max(R re,C re)-1条对角线选择K id3个索引，其中
Figure PCTCN2018085645-appb-000242
-min(R re,C re)+1≤D 4≤max(R re,C re)-1，id3和D 4为整数；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 It should be noted that selecting a predetermined number of indexes from the M re diagonally includes at least one of the following: from the M re , from the -min(R re , C re )+1, -min(R re , C Re )+2,...,D 1 diagonally select K id1 index, where
Figure PCTCN2018085645-appb-000240
-min(R re , C re )+1≤D 1 ≤max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which
Figure PCTCN2018085645-appb-000241
-min(R re , C re )+1≤D 2 ≤D 3 ≤max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonally select K id3 indexes, of which
Figure PCTCN2018085645-appb-000242
-min(R re , C re )+1≤D 4 ≤max(R re ,C re )-1, id3 and D 4 are integers; wherein min(R re , C re ) denotes R re and C re The minimum of the two, max(R re , C re ), represents the maximum of both R re and C re .
需要说明的是，在从M re中按行或按列或按对角方式选取预定数量的索引的过程中，跳过第二比特序列矩阵中未发送比特序列对应的索引，其中，所述第二比特序列矩阵为第一比特序列矩阵进行第二预定变换得到的，所述第一比特序列矩阵为所述极化码编码后比特序列组成，其中，所述第二预定变换包括：行置换或者列置换。 It should be noted that, in the process of selecting a predetermined number of indexes by row or column or diagonally from M re , skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
需要说明的是，上述选取模块36，还可以配置为从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列。It should be noted that the foregoing selection module 36 may be further configured to sequentially select T bits as a to-be-transmitted bit sequence from the second bit sequence matrix by row or column or diagonally.
需要说明的是，上述选取模块36还可以配置为从第二比特序列矩阵中的起始位置t开始，按行或按列或按对角方式从第二比特序列矩阵中依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到第二比特序列矩阵中的最后一个比特或第一个比特继续选取，1≤t≤R vb×C vb。 It should be noted that the selection module 36 may be further configured to sequentially select T bits from the second bit sequence matrix in a row or column or diagonal manner starting from a starting position t in the second bit sequence matrix. Wherein, when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit that jumps to the second bit sequence matrix continues to be selected, 1≤t≤R vb ×C Vb .
需要说明的是，上述选取模块36还可以配置为在T小于或者等于极化码编码后比特序列的长度N时，按列依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按行依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按对角方式依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T大于极化码编码后比特序列的长度N时，从第二 比特序列矩阵中第t个比特开始，按行或按列或按对角方式依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到最后一个比特或者第一个比特继续选取，其中，1≤t≤R vb×C vb-1；其中，N为正整数。 It should be noted that the selection module 36 may be further configured to select the first to T bits or the Nth of the second bit sequence matrix in columns when the T is less than or equal to the length N of the bit sequence after the polarization code is encoded. -T+1 to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 in the second bit sequence matrix are sequentially selected in rows. Up to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 to N in the second bit sequence matrix are sequentially selected in a diagonal manner a bit; when T is greater than the length N of the bit sequence after the polarization code is encoded, starting from the t-th bit in the second bit sequence matrix, T bits are sequentially selected by row or column or diagonally, wherein When the first bit or the last bit in the second bit sequence matrix is fetched, the last bit or the first bit is skipped, wherein 1≤t≤R vb ×C vb -1; wherein N is A positive integer.
需要说明的是，从第二比特序列矩阵中按列依次选取T个比特包括以下至少之一：依次从第1,2，…,E 1列选择T ie1个比特，其中，
Figure PCTCN2018085645-appb-000243
1≤E 1≤C vb，ie1和E 1为整数；依次从第E 2,E 2+1，…,E 3列选择T ie2个比特，其中
Figure PCTCN2018085645-appb-000244
1≤E 2≤E 3≤C re，ie2，E 2和E 3为整数；依次从第E 4,E 4+1，…,E vb列选择T ie3个比特，其中
Figure PCTCN2018085645-appb-000245
1≤E 4≤C vb，ie3和E 4为整数。 Incidentally, the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein
Figure PCTCN2018085645-appb-000243
1 ≤ E 1 ≤ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein
Figure PCTCN2018085645-appb-000244
1 ≤ E 2 ≤ E 3 ≤ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein
Figure PCTCN2018085645-appb-000245
1 ≤ E 4 ≤ C vb , ie3 and E 4 are integers.
需要说明的是，从第二比特序列矩阵中按行依次选取T个比特包括以下至少之一：依次从第1,2，…,F 1行选择T if1个比特，其中
Figure PCTCN2018085645-appb-000246
1≤F 1≤R vb，if1和F 1为整数；依次从第F 2,F 2+1，…,F 3行选择T if2个比特，其中
Figure PCTCN2018085645-appb-000247
1≤F 2≤F 3≤R vb，if2，F 2和F 3为整数；依次从第F 4,F 4+1，…,R vb行选择T if3个比特，其中
Figure PCTCN2018085645-appb-000248
1≤F 4≤R vb，if3和F 4为整数。 It should be noted that selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein
Figure PCTCN2018085645-appb-000246
1 ≤ F 1 ≤ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein
Figure PCTCN2018085645-appb-000247
1≤F 2 ≤F 3 ≤R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein
Figure PCTCN2018085645-appb-000248
1 ≤ F 4 ≤ R vb , if3 and F 4 are integers.
需要说明的是，从第二比特序列矩阵中按对角方式依次选取T个比特包括以下至少之一：依次从第-min(R vb,C re)+1,-min(R vb,C vb)+2，…,G 1条对角线选择T ig1个比特，其中，
Figure PCTCN2018085645-appb-000249
-min(R vb,C vb)+1≤G 1≤max(R vb,C vb)-1，ig1和G 1为整数；依次从第G 2,G 2+1，…,G 3条对角线选择K ig2个比特，其中
Figure PCTCN2018085645-appb-000250
-min(R vb,C vb)+1≤G 2≤G 3≤max(R vb,C vb)-1，ig2，G 2和G 3为整数；依次从第G 4,G 4+1，…,max(R vb,C vb)-1条对角线选择K id3个比特，其中
Figure PCTCN2018085645-appb-000251
-min(R vb,C vb)+1≤G 4≤max(R vb,C vb)-1，ig3和G 4为整数。 It should be noted that T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where
Figure PCTCN2018085645-appb-000249
-min(R vb , C vb ) +1 ≤ G 1 ≤ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which
Figure PCTCN2018085645-appb-000250
-min(R vb , C vb )+1≤G 2 ≤G 3 ≤max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally select K id3 bits, of which
Figure PCTCN2018085645-appb-000251
-min(R vb , C vb )+1≤G 4 ≤max(R vb , C vb )-1, ig3 and G 4 are integers.
需要说明的是，上述装置可以位于终端中，也可以位于网络侧设备比如基站中，但并不限于此。It should be noted that the foregoing apparatus may be located in the terminal, or may be located in a network side device such as a base station, but is not limited thereto.
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。It should be noted that each of the above modules may be implemented by software or hardware. For the latter, the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination. The forms are located in different processors.
实施例3Example 3
本申请实施例3提供了一种设备，图4是根据本申请实施例3提供的设备的结构框图，如图4所示，该设备包括：Embodiment 3 of the present application provides a device, and FIG. 4 is a structural block diagram of a device according to Embodiment 3 of the present application. As shown in FIG. 4, the device includes:
处理器42，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；以及从极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T；The processor 42 is configured to map the first bit sequence of length K bits to the specified position according to the M_index to obtain a second bit sequence, and perform polarization code encoding on the second bit sequence to obtain a bit sequence after the polarization code encoding; And selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted; wherein, K and T are positive integers, K≤T;
存储器44，与上述处理器42耦接。The memory 44 is coupled to the processor 42 described above.
通过上述设备，将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列，即本申请提供了一种待发送比特序列的确定方法，因而解决了上述相关技术中5G New RAT中没有相应的序列确定方法的问题。Through the above device, the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding; The T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.
在本申请的一个实施例中，上述处理器42，还可以配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过第二索引矩阵得到M_index；其中，第一预定变换包括：行置换或者列置换。即在极化码编码过程中，第一索引矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一索引矩阵的另一维数即可，因此，可以在极化码的实现过程中，可以实现硬件的复用，因此，可以解决相关技术中极化码编码过程中硬件不能复用的问题。In an embodiment of the present application, the processor 42 may be further configured to: obtain a second index matrix by using a first predetermined transformation by the first index matrix; and obtain an M_index by using the second index matrix; wherein, the first predetermined transformation comprises: Row permutation or column permutation. That is, in the polarization code encoding process, the first index matrix has the same transformation mode in the same dimension, so that when the length of the mother code changes, only another dimension of the first index matrix needs to be changed, and therefore, the polarization can be In the implementation process of the code, the multiplexing of the hardware can be realized. Therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art can be solved.
在本申请的一个实施例中，上述处理器42，还可以配置为将极化码编码后比特序列写入第一比特序列矩阵；将第一比特序列矩阵进行第二预定 变换，得到第二比特序列矩阵；其中，第二预定变换包括：行置换或者列置换；选取模块，还配置为从第二比特序列矩阵中选取T个比特作为待发送比特序列。即第一比特序列矩阵同一维度的变换模式相同，可以使得在母码长度变化时，只需要改变第一比特序列矩阵的另一维数即可，因而可以在极化码的实现过程中，可以进一步实现硬件的复用，因此，进一步解决相关技术中极化码编码过程中硬件不能复用的问题。In an embodiment of the present application, the processor 42 may be further configured to: write a bit sequence encoded by the polarization code into the first bit sequence matrix; perform a second predetermined transform on the first bit sequence matrix to obtain a second bit. a sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation; and the selecting module is further configured to select T bits from the second bit sequence matrix as the bit sequence to be transmitted. That is, the transformation pattern of the same dimension of the first bit sequence matrix is the same, so that when the length of the mother code changes, only another dimension of the first bit sequence matrix needs to be changed, so that the implementation of the polarization code can be performed. The multiplexing of the hardware is further implemented, and therefore, the problem that the hardware cannot be reused in the polarization code encoding process in the related art is further solved.
需要说明的是，上述存储器可以配置为存储上述第二比特序列矩阵，上述存储器可以是缓存或者其他存储器比如内存或其他逻辑存在，但并不限于此。It should be noted that the foregoing memory may be configured to store the second bit sequence matrix, and the memory may be a cache or other memory such as memory or other logic, but is not limited thereto.
需要说明的是，上述第一索引矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一索引矩阵为二维矩阵为例，上述同一维度的变换模式相同可以表现为：第一索引矩阵的行变换模式相同或者列变换模式相同。It should be noted that the first index matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto. The first index matrix is a two-dimensional matrix, and the transformation mode of the same dimension is used. The same can be expressed as: the row transformation mode of the first index matrix is the same or the column transformation mode is the same.
以上述第一索引矩阵为二维矩阵为例，在本申请的一个实施例中，第二索引矩阵为M re，M re为R re行C re列的矩阵，第一索引矩阵为M or，M or为 Taking the first index matrix as a two-dimensional matrix as an example, in one embodiment of the present application, the second index matrix is M re , and M re is a matrix of R re rows C re columns, and the first index matrix is M or M or is
Figure PCTCN2018085645-appb-000252
或者，
Figure PCTCN2018085645-appb-000252
or,
Figure PCTCN2018085645-appb-000253
Figure PCTCN2018085645-appb-000253
其中，R re×C re≥N R re和C re均为正整数；N为极化码编码后比特序列的长度。 Where R re × C re ≥ N R re and C re are positive integers; N is the length of the bit sequence after polarization code encoding.
需要说明的是，在R re不变的情况下，C re为满足R re×C re≥N的最小值；或者，在C re不变的情况下，R re为满足R re×C re≥N的最小值。 Incidentally, in the case where R re unchanged, C re is the minimum value satisfying R re × C re ≥N; or in the case of constant C re, R re to meet R re × C re ≥ The minimum value of N.
需要说明的是，上述处理器42还配置为通过以下至少之一得到第二索引矩阵：M re的第i列为M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数；M re的第j行为M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 It should be noted that the processor 42 is further configured to obtain the second index matrix by at least one of the following: the ith column of M re is the π 1 (i) column of the M or the column replacement, wherein 0 ≤ i≤C re -1,0≤π 1 (i) ≤C re -1, R re × C re ≥N, i and π 1 (i) are positive integers; M or behavior of the j-th of the M re π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re × C re ≥N, j and π 2 (j ) are positive integers.
需要说明的是，上述π 1(i)通过以下至少之一方式获取：方式一：π 1(i)＝BRO(i)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数i转换为第一二进制数(B n1-1,B n1-2,…,B 0)，将第一二进制数反序排列得到第二二进制数(B 0,B 1,…,B n1-1)，再将第二二进制数转换成十进制数得到π 1(i)，其中，n1＝log 2(C re)，0≤i≤C re-1；方式二：π 1(i)＝{S1,S2,S3}，其中，S1＝{0,1,…,i1-1}，S2＝{i2,i3,i2+1,i3+1,…,i4,i5}，S3为{0,1,…,C re-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C re/8≤i1≤i2≤C re/3,i2≤i4≤i3≤2C re/3,i3≤i5≤C re-1，其中，i1、i2、i3、i4和i5均为正整数，且S1，S2与S3任意两者的交集为空集；方式三：π 1(i)＝{I}，其中，序列{I}由M or的列索引r按照函数f(r)计算得到的数值结果升序或降序顺序排列得到，0≤r≤C re-1，f(r)具有单调性。 It should be noted that the above π 1 (i) is obtained by at least one of the following manners: mode 1: π 1 (i)=BRO(i), wherein BRO() represents a bit reverse sequence operation, and the bit reverse sequence operation includes: i decimal number into a first binary number (B n1-1, B n1-2, ... , B 0), the reverse order of the first binary number to obtain a second binary number (B 0, B 1 ,...,B n1-1 ), and then converting the second binary number into a decimal number to obtain π 1 (i), where n1=log 2 (C re ), 0≤i≤C re -1; Manner 2: π 1 (i)={S1, S2, S3}, where S1={0,1,...,i1-1},S2={i2,i3,i2+1,i3+1,..., I4, i5}, S3 is a set of {0, 1, ..., C re -1} except for the element included in S1 and the element included in S2, where C re /8 ≤ i1 ≤ i2 ≤ C re /3, i2 ≤ i4 ≤ i3 ≤ 2C re /3, i3 ≤ i5 ≤ C re -1, wherein i1, i2, i3, i4 and i5 are both positive integers, and any of S1, S2 and S3 The intersection of the set is an empty set; mode 3: π 1 (i)={I}, wherein the sequence {I} is arranged by the column index r of the M or the numerical result calculated by the function f(r) in ascending or descending order. 0≤r≤C re -1,f(r) has Monotonic.
以下举例说明上述三种方式：The following examples illustrate the above three methods:
对于方式一：若C re＝8，i＝6，则n1＝log 2(8)＝3，将i＝6转换成二进制数(B 2,B 1,B 0)＝(1,1,0)，将所述二进制数(B 2,B 1,B 0)＝(1,1,0)反序排列得到(B 0,B 1,B 2)＝(0,1,1)，再将所述二进制数(B 0,B 1,B 2)＝(0,1,1)转换成十进制得到π 1(i)＝3。 For mode one: if C re =8, i=6, then n1=log 2 (8)=3, convert i=6 into binary number (B 2 , B 1 , B 0 )=(1,1,0 ), the binary numbers (B 2 , B 1 , B 0 )=(1,1,0) are arranged in reverse order to obtain (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ), and then The binary number (B 0 , B 1 , B 2 )=( 0 , 1 , 1 ) is converted into decimal to obtain π 1 (i)=3.
对于方式二：若C re＝8，i 1＝2，i 2＝2，i 3＝4，i 4＝3，i 5＝5，则将S1＝{0,1}，S2＝{2,4,3,5}，S3＝{6,7}；π 1(i)＝{0,1,2,4,3,5,6,7}。 For mode two: If C re = 8, i 1 = 2, i 2 = 2, i 3 = 4, i 4 = 3, i 5 = 5, then S1 = {0, 1}, S2 = {2, 4,3,5}, S3={6,7}; π 1 (i)={0,1,2,4,3,5,6,7}.
对于方式三：C re＝8，{f(0),…,f(7)}＝{0,1,1.18,2.18,1.41,2.41,2.60,3.60}，将f(0),…,f(7)从小到大排列，则得到π 1(i)＝{1,2,3,5,4,6,7,8}。 For mode three: C re =8, {f(0),...,f(7)}={0,1,1.18,2.18,1.41,2.41, 2.60, 3.60}, f(0),...,f (7) From small to large, π 1 (i) = {1, 2, 3, 5, 4, 6, 7, 8} is obtained.
需要说明的是，f(r)包括以下至少之一：It should be noted that f(r) includes at least one of the following:
Figure PCTCN2018085645-appb-000254
(B n1-1,B n1-2,…,B 0)为索引r的二进制表示，0≤m1≤n1-1，n1＝log 2(C re)，k为正整数；比如：C re＝8，i＝6，k＝4，则n1＝log 2(8)＝3，将i＝6转换成二进制数(B 2,B 1,B 0)＝(1,1,0),
Figure PCTCN2018085645-appb-000255
Figure PCTCN2018085645-appb-000254
(B n1-1, B n1-2, ... , B 0) is the binary representation of the index r, 0≤m1≤n1-1, n1 = log 2 ( C re), k is a positive integer; for example: C re = 8, i=6, k=4, then n1=log 2 (8)=3, convert i=6 into a binary number (B 2 , B 1 , B 0 )=(1,1,0),
Figure PCTCN2018085645-appb-000255
将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000256
在
Figure PCTCN2018085645-appb-000257
的基础上按照第一迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000258
其中,第一迭代计算公式为
Figure PCTCN2018085645-appb-000259
其中，
Figure PCTCN2018085645-appb-000260
为r处的对数似然比均值；比如：
Figure PCTCN2018085645-appb-000261
可近似为
Figure PCTCN2018085645-appb-000262
参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000256
in
Figure PCTCN2018085645-appb-000257
Based on the first iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000258
Wherein, the first iteration calculation formula is
Figure PCTCN2018085645-appb-000259
among them,
Figure PCTCN2018085645-appb-000260
Is the log likelihood ratio mean at r; for example:
Figure PCTCN2018085645-appb-000261
Approximate
Figure PCTCN2018085645-appb-000262
The nodes i 1 , i 2 participating in the iterative calculation are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000263
σ2为噪声方差，C re＝8，σ2＝0，将
Figure PCTCN2018085645-appb-000264
代入迭代公式，得到
Figure PCTCN2018085645-appb-000265
然后将
Figure PCTCN2018085645-appb-000266
代入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000267
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000268
而
Figure PCTCN2018085645-appb-000269
0≤r≤C re-1，,{f(0),…,f(7)}＝{0.04,0.41,0.61,3.29,1.00,4.56,5.78,16.00}； Assumed initial value
Figure PCTCN2018085645-appb-000263
Σ2 is the noise variance, C re =8, σ2=0, will
Figure PCTCN2018085645-appb-000264
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000265
followed by
Figure PCTCN2018085645-appb-000266
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000267
And so on, until the calculation is
Figure PCTCN2018085645-appb-000268
and
Figure PCTCN2018085645-appb-000269
0 ≤ r ≤ C re -1,, {f(0), ..., f(7)} = {0.04, 0.41, 0.61, 3.29, 1.00, 4.56, 5.78, 16.00};
将r对应的函数值初始化为
Figure PCTCN2018085645-appb-000270
然后在
Figure PCTCN2018085645-appb-000271
的基础上按照第二迭代公式进行n1次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000272
其中，第二迭代计算公式为
Figure PCTCN2018085645-appb-000273
为r处的互信息；其中，1≤m2≤n1，1≤m3≤n1，r1,r2,2r和2r-1均为大于或者等于0且小于或者等于C re-1的整数；其中，参与迭代计算的节点i 1,i 2由极化码编码器结构决定； Initialize the function value corresponding to r to
Figure PCTCN2018085645-appb-000270
Then at
Figure PCTCN2018085645-appb-000271
Based on the second iteration formula, n1 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000272
Wherein, the second iteration calculation formula is
Figure PCTCN2018085645-appb-000273
Is the mutual information at r; wherein, 1 ≤ m2 ≤ n1, 1 ≤ m3 ≤ n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1; The iteratively calculated nodes i 1 , i 2 are determined by the polarization code encoder structure;
假设初始值
Figure PCTCN2018085645-appb-000274
C re＝8，将
Figure PCTCN2018085645-appb-000275
代入迭代公式，得到
Figure PCTCN2018085645-appb-000276
然后将
Figure PCTCN2018085645-appb-000277
代 入所述迭代公式计算得到
Figure PCTCN2018085645-appb-000278
以此类推，直至计算得到
Figure PCTCN2018085645-appb-000279
而
Figure PCTCN2018085645-appb-000280
0≤i≤C re-1，{f(0),…,f(7)}＝{0.008,0.152,0.221,0.682,0.313,0.779,0.850,0.991}。 Assumed initial value
Figure PCTCN2018085645-appb-000274
C re =8, will
Figure PCTCN2018085645-appb-000275
Substitute the iteration formula and get
Figure PCTCN2018085645-appb-000276
followed by
Figure PCTCN2018085645-appb-000277
Substituting the iteration formula to calculate
Figure PCTCN2018085645-appb-000278
And so on, until the calculation is
Figure PCTCN2018085645-appb-000279
and
Figure PCTCN2018085645-appb-000280
0 ≤ i ≤ C re -1, {f(0), ..., f(7)} = {0.008, 0.152, 0.221, 0.682, 0.313, 0.779, 0.850, 0.991}.
需要说明的是，上述π 2(j)通过以下至少之一方式获取：π 2(j)＝BRO(j)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数j转换为第三二进制数(B n2-1,B n2-2,…,B 0)，将第三二进制数反序排列得到第四二进制数(B 0,B 1,…,B n2-1)，再将第四二进制数转换成十进制数得到π 2(j)，其中，n2＝log 2(R re)，0≤j≤R re-1；π 2(j)＝{S4,S5,S6}，其中，S4＝{0,1,…,j1-1}，S5＝{j2,j3,j2+1,j3+1,…,j4,j5}，S6为{0,1,…,R re-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R re/8≤j1≤j2≤R re/3,j2≤j4≤j3≤2 R re/3,j3≤j5≤R re-1，其中，j1、j2、j3、j4和j5均为正整数，且S4，S5与S6任意两者的交集为空集；π 2(j)＝{J}，其中，序列{J}中由M or的行索引s按照函数f(s)计算得到的数值结果升序或降序顺序排列得到，0≤s≤R re-1，f(s)具有单调性。 It should be noted that the above π 2 (j) is obtained by at least one of the following methods: π 2 (j)=BRO(j), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number j into a third binary number (B n2-1, B n2-2, ... , B 0), the third binary number in reverse order to obtain a fourth binary number (B 0, B 1, ..., B n2-1 ), and then convert the fourth binary number into a decimal number to obtain π 2 (j), where n2 = log 2 (R re ), 0 ≤ j ≤ R re -1; π 2 ( j)={S4, S5, S6}, where S4={0,1,...,j1-1}, S5={j2,j3,j2+1,j3+1,...,j4,j5},S6 A set consisting of elements other than the element contained in S4 and the element contained in S5 in {0, 1, ..., R re -1}, where R re /8 ≤ j1 ≤ j2 ≤ R re /3, j2 ≤j4≤j3≤2 R re / 3, j3≤j5≤R re -1, wherein, j1, j2, j3, j4 and j5 are positive integers, and S4, S5 and S6 of any two intersection is empty ; π 2 (j) = { J}, where the sequence {J} in ascending or descending order numerical results obtained from the obtained M or arranged in a row s index calculated according to the function f (s), 0≤s≤R re - 1, f (s) has monotonicity.
需要说明的是，f(s)包括以下至少之一：
Figure PCTCN2018085645-appb-000281
(B n2-1,B n2-2,…,B 0)为索引s的二进制表示，0≤m4≤n2-1，n2＝log 2(R re)，k为正整数；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000282
在
Figure PCTCN2018085645-appb-000283
的基础上按照第三迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000284
其中,第三迭代计算公式为
Figure PCTCN2018085645-appb-000285
其中，
Figure PCTCN2018085645-appb-000286
为s处的对数似然比均值；将s对应的函数值初始化为
Figure PCTCN2018085645-appb-000287
然后在
Figure PCTCN2018085645-appb-000288
的基础上按照第四迭代公式进行n2次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000289
其中，第四迭代计算公式为
Figure PCTCN2018085645-appb-000290
其中，
Figure PCTCN2018085645-appb-000291
为s处的互信息；其中，1≤m5≤n2，1≤m6≤n2，s1,s2,2s和2s-1均为大于或者等于0且小于或者 等于R re-1的整数。 It should be noted that f(s) includes at least one of the following:
Figure PCTCN2018085645-appb-000281
(B n2-1, B n2-2, ... , B 0) is the binary representation of the index s, 0≤m4≤n2-1, n2 = log 2 ( R re), k is a positive integer; s function corresponding The value is initialized to
Figure PCTCN2018085645-appb-000282
in
Figure PCTCN2018085645-appb-000283
Based on the third iteration formula, after n2 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000284
Wherein, the third iteration calculation formula is
Figure PCTCN2018085645-appb-000285
among them,
Figure PCTCN2018085645-appb-000286
Is the log likelihood ratio mean at s; initializes the function value corresponding to s to
Figure PCTCN2018085645-appb-000287
Then at
Figure PCTCN2018085645-appb-000288
Based on the fourth iteration formula, n2 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000289
Wherein, the fourth iteration calculation formula is
Figure PCTCN2018085645-appb-000290
among them,
Figure PCTCN2018085645-appb-000291
Is the mutual information at s; wherein, 1 ≤ m5 ≤ n2, 1 ≤ m6 ≤ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
需要说明的是，上述对于π 2(j)的解释，参考π 1(i)的解释。 It should be noted that the above explanation for π 2 (j) refers to the explanation of π 1 (i).
需要说明的是，上述第一比特序列矩阵可以是二维矩阵，也可以是三维矩阵，或者多维矩阵，并不限于此，以上述第一比特序列矩阵为二维矩阵为例，上述同一维度的变换模式相同可以表现为：第一比特序列矩阵的行变换模式相同或者列变换模式相同。It should be noted that the first bit sequence matrix may be a two-dimensional matrix, or may be a three-dimensional matrix, or a multi-dimensional matrix, and is not limited thereto, and the first bit sequence matrix is taken as a two-dimensional matrix, for example, the same dimension The same transformation mode can be expressed as follows: the row transformation mode of the first bit sequence matrix is the same or the column transformation mode is the same.
需要说明的是，第一比特序列矩阵为M og，第二比特序列矩阵为M vb，M vb为R vb行C vb列的矩阵，M og为 It should be noted that the first bit sequence matrix is M og , the second bit sequence matrix is M vb , and M vb is a matrix of R vb rows C vb columns, and M og is
Figure PCTCN2018085645-appb-000292
或者，
Figure PCTCN2018085645-appb-000292
or,
Figure PCTCN2018085645-appb-000293
Figure PCTCN2018085645-appb-000293
其中，x 0,x 1,x 2,…,
Figure PCTCN2018085645-appb-000294
为极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为极化码编码后比特序列的长度。 Where x 0 , x 1 , x 2 ,...,
Figure PCTCN2018085645-appb-000294
For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are positive integers, and N is the length of the bit sequence after polarization code encoding.
需要说明的是，在R vb不变的情况下，C vb为满足R vb×C vb≥N的最小值；或者，在C vb不变的情况下，R vb为满足R vb×C vb≥N的最小值。 Incidentally, in the case where the constant R vb, C vb is the minimum value satisfying R vb × C vb ≥N; or in the case of constant C vb, R vb is satisfied R vb × C vb ≥ The minimum value of N.
需要说明的是，上述处理器42还配置为通过以下至少之一得到第二比特序列矩阵：M vb的第g列为M og的第π 3(g)列经过列置换得到的，其中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数；M vb的第h行为M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 Note that the processor 42 is also configured to obtain at least one second bit sequence matrix: g M vb of the section as M og π 3 (g) after column permutation obtained column, wherein 0 ≤g≤C vb -1,0≤π 3 (g) ≤C vb -1, R vb × C vb ≥N, g , and π 3 (g) are positive integers; h-M vb behavior of the M og of π 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π 4 (h) ≤R vb -1, R vb × C vb ≥N, h and π 4 ( h) are positive integers.
需要说明的是，π 3(g)通过以下至少之一方式获取：π 3(g)＝BRO(g)， 其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数g转换为第五二进制数(B n3-1,B n3-2,…,B 0)，将第五二进制数反序排列得到第六二进制数(B 0,B 11,…,B n3-1)，再将第六二进制数转换成十进制数得到π 3(g)，其中，n3＝log 2(C vb)，0≤g≤C vb-1；π 3(g)＝{S1,S2,S3}，其中，S1＝{0,1,…,g1-1}，S2＝{g2,g3,g2+1,g3+1,…,g4,g5}，S3为{0,1,…,C vb-1}中除了S1包含的元素和S2包含的元素之外的其他元素组成的集合，其中，C vb/8≤g1≤g2≤C vb/3,g2≤g4≤g3≤2C vb/3,g3≤g5≤C vb-1，其中，g1、g2、g3、g4和g5均为正整数，且S1，S2与S3任意两者的交集为空集；π 3(g)＝{G}，其中，序列{G}由M og的列索引α按照函数f(α)计算得到的数值结果升序或降序顺序排列得到，0≤α≤C vb-1，f(α)具有单调性；π 3(g)＝{Q1,Q2,Q3},其中，Q2＝{q1,q2,q1+1,q2+1,…,q3,q4}，其中0≤q1<q3≤(C vb-1)/2,0≤q2<q4≤(C vb-1)/2,q1,q2,q3和q4均为正整数,Q1和Q3为{0,1，…，C vb-1}与Q2差集中的其他元素，且Q1,Q2,Q3任意两者的交集为空集；在nV1个相同位置上π 3(g)与预定义序列V1的元素不同，其中，V1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nV1≤23；在nV2个相同位置上π 3(g)与预定义序列V2的元素不同，其中，V2＝{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}，0≤nV2≤3。 It should be noted that π 3 (g) is obtained by at least one of the following methods: π 3 (g)=BRO(g), where BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number g Converted to a fifth binary number (B n3-1 , B n3-2 , ..., B 0 ), and the fifth binary number is arranged in reverse order to obtain a sixth binary number (B 0 , B 11 ,... , B n3-1 ), and then convert the sixth binary number into a decimal number to obtain π 3 (g), where n3=log 2 (C vb ), 0≤g≤C vb -1; π 3 (g )={S1,S2,S3}, where S1={0,1,...,g1-1},S2={g2,g3,g2+1,g3+1,...,g4,g5},S3 is {0,1,..., C vb -1} A set of elements other than the element contained in S1 and the element contained in S2, wherein C vb /8 ≤ g1 ≤ g2 ≤ C vb / 3, g2 ≤ G4 ≤ g3 ≤ 2C vb /3, g3 ≤ g5 ≤ C vb -1, wherein g1, g2, g3, g4 and g5 are all positive integers, and the intersection of any of S1, S2 and S3 is an empty set; π 3 (g)={G}, where the sequence {G} is arranged in ascending or descending order by the numerical result calculated by the function f(α) of the column index α of the M og , 0 ≤ α ≤ C vb -1, f ([alpha]) is monotone; π 3 (g) = { Q1, Q2, Q3}, In, Q2 = {q1, q2, q1 + 1, q2 + 1, ..., q3, q4}, where 0≤q1 <q3≤ (C vb -1) / 2,0≤q2 <q4≤ (C vb - 1) /2, q1, q2, q3 and q4 are positive integers, Q1 and Q3 are {0, 1, ..., C vb -1} and other elements in the Q2 difference set, and any of Q1, Q2, Q3 The intersection is an empty set; π 3 (g) is different from the element of the predefined sequence V1 at the same position of nV1, where V1={0,1,2,3,4,5,6,7,8,9 ,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nV1≤ 23; π 3 (g) is different from the element of the predefined sequence V2 at the same position of nV2, where V2={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}, 0 ≤ nV2 ≤ 3.
需要说明的是，f(α)包括以下至少之一：
Figure PCTCN2018085645-appb-000295
(B n3-1,B n3-2,…,B 0)为索引α的二进制表示，0≤m6≤n3-1，n3＝log 2(C vb)，k为正整数；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000296
在
Figure PCTCN2018085645-appb-000297
的基础上按照第五迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000298
其中,第五迭代计算公式为
Figure PCTCN2018085645-appb-000299
其中，
Figure PCTCN2018085645-appb-000300
为r处的对数似然 比均值；将α对应的函数值初始化为
Figure PCTCN2018085645-appb-000301
然后在
Figure PCTCN2018085645-appb-000302
的基础上按照第六迭代公式进行n3次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000303
其中，第六迭代计算公式为
Figure PCTCN2018085645-appb-000304
为r处的互信息；其中，1≤m7≤n3，1≤m8≤n3，α1,α2,2α和2α-1均为大于或者等于0且小于或者等于C vb-1的整数。 It should be noted that f(α) includes at least one of the following:
Figure PCTCN2018085645-appb-000295
(B n3-1 , B n3-2 , ..., B 0 ) is a binary representation of the index α, 0 ≤ m6 ≤ n3-1, n3 = log 2 (C vb ), k is a positive integer; a function corresponding to α The value is initialized to
Figure PCTCN2018085645-appb-000296
in
Figure PCTCN2018085645-appb-000297
Based on the fifth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000298
Among them, the fifth iteration calculation formula is
Figure PCTCN2018085645-appb-000299
among them,
Figure PCTCN2018085645-appb-000300
Is the log likelihood ratio mean at r; initializes the function value corresponding to α to
Figure PCTCN2018085645-appb-000301
Then at
Figure PCTCN2018085645-appb-000302
Based on the sixth iteration formula for n3 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000303
Wherein, the sixth iteration calculation formula is
Figure PCTCN2018085645-appb-000304
It is mutual information at r; wherein, 1 ≤ m7 ≤ n3, 1 ≤ m8 ≤ n3, α1, α2, 2α and 2α-1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
需要说明的是，π 4(h)通过以下至少之一方式获取：π 4(h)＝BRO(h)，其中，BRO()表示比特反序操作，比特反序操作包括：将十进制数h转换为第七二进制数(B n4-1,B n4-2,…,B 0)，将第七二进制数反序排列得到第八二进制数(B 0,B 1,…,B n4-1)，再将第八二进制数转换成十进制数得到π 4(h)，其中，n4＝log 2(R vb)，0≤h≤R vb-1；π 4(h)＝{S4,S5,S6}，其中，S4＝{0,1,…,h1-1}，S5＝{h2,h3,h2+1,h3+1,…,h4,h5}，S6为{0,1,…,R vb-1}中除了S4包含的元素和S5包含的元素之外的其他元素组成的集合，其中，R vb/8≤h1≤h2≤R vb/3,h2≤h4≤h3≤2R vb/3,h3≤h5≤R vb-1，其中，h1、h2、h3、h4和h5均为正整数，且S4，S5与S6任意两者的交集为空集；π 4(h)＝{H}，其中，序列{H}中由M og的行索引β按照函数f(β)计算得到的数值结果升序或降序顺序排列得到，0≤β≤R vb-1，f(β)具有单调性；π 4(h)＝{O1,O2,O3},其中，O2＝{o1,o2,o1+1,o2+1,…,o3,o4}，其中0≤o1<o3≤(R vb-1)/2,0≤o2<o4≤(R vb-1)/2,o1,o2,o3和o4均为正整数,O1和O3为{0,1，…，R vb-1}与O2差集中的其他元素，且O1,O2,O3任意两者的交集为空集；在nVV1个相同位置上π 4(h)与预定义序列VV1的元素不同，其中VV1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nVV1≤23；在nVV2个相同位置上π 4(h)与预定义序列VV2的元素不同，其中VV2＝{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}，0≤nVV2≤3。 It should be noted that π 4 (h) is obtained by at least one of the following methods: π 4 (h)=BRO(h), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: a decimal number h Converted to a seventh binary number (B n4-1 , B n4-2 , ..., B 0 ), and the seventh binary number is arranged in reverse order to obtain an eighth binary number (B 0 , B 1 ,... , B n4-1 ), and then convert the eighth binary number into a decimal number to obtain π 4 (h), where n4=log 2 (R vb ), 0 ≤ h ≤ R vb -1; π 4 (h )={S4,S5,S6}, where S4={0,1,...,h1-1},S5={h2,h3,h2+1,h3+1,...,h4,h5},S6 is {0,1,..., R vb -1} is a set of elements other than the element contained in S4 and the element contained in S5, where R vb /8≤h1≤h2≤R vb /3, h2≤ H4≤h3≤2R vb /3, h3≤h5≤R vb -1, wherein h1, h2, h3, h4 and h5 are positive integers, and the intersection of any of S4, S5 and S6 is an empty set; π 4 (h)={H}, wherein the sequence {H} is obtained by ascending or descending order of the numerical results calculated by the function f(β) of the row index β of the M og , 0 ≤ β ≤ R vb -1, f (β) is monotone; π 4 (h) = { O1, O2, O3}, In, O2 = {o1, o2, o1 + 1, o2 + 1, ..., o3, o4}, where 0≤o1 <o3≤ (R vb -1) / 2,0≤o2 <o4≤ (R vb - 1) /2, o1, o2, o3 and o4 are positive integers, O1 and O3 are {0, 1, ..., R vb -1} and other elements in the O2 difference set, and any of O1, O2, O3 The intersection of the sets is an empty set; π 4 (h) is different from the elements of the predefined sequence VV1 at the same position of nVV, where VV1={0,1,2,3,4,5,6,7,8,9, 10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31},0≤nVV1≤23 π 4 (h) is different from the elements of the predefined sequence VV2 at the same nVV 2 positions, where VV2={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}, 0 ≤ nVV2 ≤ 3.
需要说明的是，f(β)包括以下至少之一：
Figure PCTCN2018085645-appb-000305
(B n4-1,B n4-2,…,B 0)为索引β的二进制表示，0≤m9≤n4-1，n4＝log 2(R vb)，k为正整数；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000306
在
Figure PCTCN2018085645-appb-000307
的基础上按照第七迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000308
其中,第七迭代计算公式为
Figure PCTCN2018085645-appb-000309
其中，
Figure PCTCN2018085645-appb-000310
为r处的对数似然比均值；将β对应的函数值初始化为
Figure PCTCN2018085645-appb-000311
然后在
Figure PCTCN2018085645-appb-000312
的基础上按照第八迭代公式进行n4次迭代更新后，得到每个元素的函数值
Figure PCTCN2018085645-appb-000313
其中，第八迭代计算公式为
Figure PCTCN2018085645-appb-000314
为β处的互信息；其中，1≤m10≤n4，1≤m11≤n4，β1,β2,2β和2β-1均为大于或者等于0且小于或者等于R vb-1的整数。 It should be noted that f(β) includes at least one of the following:
Figure PCTCN2018085645-appb-000305
(B n4-1 , B n4-2 , ..., B 0 ) is a binary representation of the index β, 0 ≤ m9 ≤ n4-1, n4 = log 2 (R vb ), k is a positive integer; a function corresponding to β The value is initialized to
Figure PCTCN2018085645-appb-000306
in
Figure PCTCN2018085645-appb-000307
Based on the seventh iteration formula for n4 iterations, the function value of each element is obtained.
Figure PCTCN2018085645-appb-000308
Wherein, the seventh iteration calculation formula is
Figure PCTCN2018085645-appb-000309
among them,
Figure PCTCN2018085645-appb-000310
Is the log likelihood ratio mean at r; initializes the function value corresponding to β to
Figure PCTCN2018085645-appb-000311
Then at
Figure PCTCN2018085645-appb-000312
Based on the eighth iteration formula, n4 iterations are updated, and the function value of each element is obtained.
Figure PCTCN2018085645-appb-000313
Among them, the eighth iteration calculation formula is
Figure PCTCN2018085645-appb-000314
It is a mutual information at β; wherein, 1 ≤ m10 ≤ n4, 1 ≤ m11 ≤ n4, β1, β2, 2β and 2β-1 are integers greater than or equal to 0 and less than or equal to R vb -1 .
需要说明的是，对于π 3(g),π 4(h)的解释，参考π 1(i),此处不再赘述。 It should be noted that for the explanation of π 3 (g) and π 4 (h), reference is made to π 1 (i), and details are not described herein again.
在本申请的一个实施例中，上述第一变换模块还配置为从M re中按行或按列或按对角方式选取预定数量的索引，将预定数量的索引作为M_index。 In an embodiment of the present application, the first transform module is further configured to select a predetermined number of indexes from the M re by row or column or diagonally, and use a predetermined number of indexes as M_index.
需要说明的是，从M re中按列选取预定数量的索引包括：从M re中第p列选取K p个索引，其中，
Figure PCTCN2018085645-appb-000315
p为整数，且1≤p≤C re；从M re中按行选取预定数量的索引包括：从M re中第q行选取K q个索引，其中，
Figure PCTCN2018085645-appb-000316
q为整数，且1≤q≤R re；从M re中按对角方式选取预定数量的索引包括：从M re中第δ条对角线上选取K δ个索引，其中，
Figure PCTCN2018085645-appb-000317
δ为整数，且-min(R re,C re)+1≤δ≤max(R re,C re)-1；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 Incidentally, by selecting a predetermined number of columns from M re index comprises: selecting from the p-th column of M re index K p, wherein
Figure PCTCN2018085645-appb-000315
p is an integer, and 1≤p≤C re; selecting a predetermined number of rows from the M re index comprises: selecting from the M re K q q-row index, wherein
Figure PCTCN2018085645-appb-000316
q is an integer, and 1 ≤ q ≤ R re ; selecting a predetermined number of indexes diagonally from M re includes: selecting K δ indexes from the diagonal line of the δth line in M re , wherein
Figure PCTCN2018085645-appb-000317
δ is an integer, and -min(R re , C re )+1≤δ≤max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
本申请一实施方式中，从M re中按列选取预定数量的索引包括以下至少之一：从M re中依次从第1,2，…,C 1列选择K ic1个索引，其中
Figure PCTCN2018085645-appb-000318
1≤ic1≤C 1，1≤C 1≤C re，ic1和C 1为整数；从M re中依次从第C 2,C 2+1，…,C 3列选择K ic2个索引，其中
Figure PCTCN2018085645-appb-000319
C 2≤ic2≤C 3，1≤C 2≤C 3≤C re，ic2，C 2和C 3为整数；从M re中依次从第C 4,C 4+1，…,C re列选择K ic3个索引得到的，其中
Figure PCTCN2018085645-appb-000320
C 4≤ic3≤C re，1≤C 4≤C re，ic3和C 4为整数。 In an embodiment of the present application, selecting a predetermined number of indexes from the column of M re includes at least one of: selecting K ic1 indexes from the first, second, ..., C 1 columns in order from M re , wherein
Figure PCTCN2018085645-appb-000318
1 ≤ ic1 ≤ C 1 , 1 ≤ C 1 ≤ C re , ic1 and C 1 are integers; K ic2 indices are selected from M re sequentially from the C 2 , C 2 +1, ..., C 3 columns, wherein
Figure PCTCN2018085645-appb-000319
C 2 ≤ ic2 ≤ C 3 , 1 ≤ C 2 ≤ C 3 ≤ C re , ic2, C 2 and C 3 are integers; from M re in turn, from C 4 , C 4 +1, ..., C re column K ic3 indexes obtained, of which
Figure PCTCN2018085645-appb-000320
C 4 ≤ic3≤C re, 1≤C 4 ≤C re, ic3 and C 4 are integers.
本申请一实施方式中，从M re中按行选取预定数量的索引以下至少之一：从M re中依次从第1,2，…,R 1行选择K ir1个索引，其中
Figure PCTCN2018085645-appb-000321
≤ir1≤R 1，1≤R 1≤R re，ir1和R 1为整数；从M re中依次从第R 2,R 2+1，…,R 3行选择K ir2个索引，其中
Figure PCTCN2018085645-appb-000322
R 2≤ir2≤R 3，1≤R 2≤R 3≤R re，ir2，R 2和R 3为整数；从M re中依次从第R 4,R 4+1，…,R re行选择K ir3个索引，其中
Figure PCTCN2018085645-appb-000323
1≤R 4≤R re，ir3和R 4为整数。 In an embodiment of the present application, at least one of a predetermined number of indexes is selected from the M re by row: from the M re , the K ir1 indexes are sequentially selected from the 1st, 2nd, ..., R 1 rows, wherein
Figure PCTCN2018085645-appb-000321
≤ ir1 ≤ R 1 , 1 ≤ R 1 ≤ R re , ir1 and R 1 are integers; K ir2 indices are selected from M re sequentially from the R 2 , R 2 +1, ..., R 3 rows, wherein
Figure PCTCN2018085645-appb-000322
R 2 ≤ ir2 ≤ R 3 , 1 ≤ R 2 ≤ R 3 ≤ R re , ir2, R 2 and R 3 are integers; and from R re is selected from the order of R 4 , R 4 +1, ..., R re K ir3 indexes, of which
Figure PCTCN2018085645-appb-000323
1 ≤ R 4 ≤ R re , and ir3 and R 4 are integers.
本申请一实施方式中，从M re中按对角方式选取预定数量的索引包括以下至少之一：从M re中依次从第-min(R re,C re)+1,-min(R re,C re)+2，…,D 1条对角线选择K id1个索引，其中
Figure PCTCN2018085645-appb-000324
-min(R re,C re)+1≤D 1≤max(R re,C re)-1，id1和D 1为整数；从M re中依次从第D 2,D 2+1，…,D 3条对角线选择K id2个索引，其中
Figure PCTCN2018085645-appb-000325
-min(R re,C re)+1≤D 2≤D 3≤max(R re,C re)-1，id2，D 2和D 3为整数；从M re中依次从第D 4,D 4+1，…,max(R re,C re)-1条对角线选择K id3个索引，其中
Figure PCTCN2018085645-appb-000326
-min(R re,C re)+1≤D 4≤max(R re,C re)-1，id3和D 4为整数；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 In an embodiment of the present application, selecting a predetermined number of indexes from the M re in a diagonal manner includes at least one of the following: from the M re , from the first -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 diagonally select K id1 index, where
Figure PCTCN2018085645-appb-000324
-min(R re , C re )+1≤D 1 ≤max(R re ,C re )-1, id1 and D 1 are integers; from M re in order from D 2 , D 2 +1,..., D 3 diagonals select K id 2 indexes, of which
Figure PCTCN2018085645-appb-000325
-min(R re , C re )+1≤D 2 ≤D 3 ≤max(R re ,C re )-1, id2, D 2 and D 3 are integers; from M re in order from D 4 , D 4 +1,...,max(R re ,C re )-1 diagonally select K id3 indexes, of which
Figure PCTCN2018085645-appb-000326
-min(R re , C re )+1≤D 4 ≤max(R re ,C re )-1, id3 and D 4 are integers; wherein min(R re , C re ) denotes R re and C re The minimum of the two, max(R re , C re ), represents the maximum of both R re and C re .
需要说明的是，在从M re中按行或按列或按对角方式选取预定数量的索引的过程中，跳过第二比特序列矩阵中未发送比特序列对应的索引，其 中，所述第二比特序列矩阵为第一比特序列矩阵进行第二预定变换得到的，所述第一比特序列矩阵为所述极化码编码后比特序列组成，其中，所述第二预定变换包括：行置换或者列置换。 It should be noted that, in the process of selecting a predetermined number of indexes by row or column or diagonally from M re , skipping the index corresponding to the untransmitted bit sequence in the second bit sequence matrix, wherein the The two-bit sequence matrix is obtained by performing a second predetermined transformation on the first bit sequence matrix, wherein the first bit sequence matrix is composed of the polarization code encoded bit sequence, wherein the second predetermined transformation comprises: row permutation or Column permutation.
需要说明的是，上述处理器42，还可以配置为从第二比特序列矩阵中按行或按列或按对角方式依次选取T个比特作为待发送比特序列。It should be noted that the processor 42 may be further configured to sequentially select T bits as a to-be-transmitted bit sequence in a row or column or diagonal manner from the second bit sequence matrix.
需要说明的是，上述处理器42还可以配置为从第二比特序列矩阵中的起始位置t开始，按行或按列或按对角方式从第二比特序列矩阵中依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到第二比特序列矩阵中的最后一个比特或第一个比特继续选取，1≤t≤R vb×C vb。 It should be noted that the processor 42 may be further configured to sequentially select T bits from the second bit sequence matrix in a row or column or diagonal manner starting from a starting position t in the second bit sequence matrix. Wherein, when the first bit or the last bit in the second bit sequence matrix is selected, the last bit or the first bit that jumps to the second bit sequence matrix continues to be selected, 1≤t≤R vb ×C Vb .
需要说明的是，上述处理器42还可以配置为在T小于或者等于极化码编码后比特序列的长度N时，按列依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按行依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T小于或者等于极化码编码后比特序列的长度N时，按对角方式依次选取第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；在T大于极化码编码后比特序列的长度N时，从第二比特序列矩阵中第t个比特开始，按行或按列或按对角方式依次选取T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到最后一个比特或者第一个比特继续选取，其中，1≤t≤R vb×C vb；其中，N为正整数。 It should be noted that the processor 42 may be configured to select the first to T bits or the Nth of the second bit sequence matrix in columns when the T is less than or equal to the length N of the bit sequence after the polarization code encoding. -T+1 to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 in the second bit sequence matrix are sequentially selected in rows. Up to N bits; when T is less than or equal to the length N of the bit sequence after polarization code encoding, the first to T bits or the N-T+1 to N in the second bit sequence matrix are sequentially selected in a diagonal manner a bit; when T is greater than the length N of the bit sequence after the polarization code is encoded, starting from the t-th bit in the second bit sequence matrix, T bits are sequentially selected by row or column or diagonally, wherein When the first bit or the last bit in the second bit sequence matrix is taken, the last bit or the first bit is skipped, where 1≤t≤R vb ×C vb ; where N is a positive integer .
需要说明的是，从第二比特序列矩阵中按列依次选取T个比特包括以下至少之一：依次从第1,2，…,E 1列选择T ie1个比特，其中，
Figure PCTCN2018085645-appb-000327
1≤E 1≤C vb，ie1和E 1为整数；依次从第E 2,E 2+1，…,E 3列选择T ie2个比特，其中
Figure PCTCN2018085645-appb-000328
1≤E 2≤E 3≤C re，ie2，E 2和E 3为整数；依次从第E 4,E 4+1，…, E vb列选择T ie3个比特，其中
Figure PCTCN2018085645-appb-000329
1≤E 4≤C vb，ie3和E 4为整数。 Incidentally, the second bit sequence from the column matrix by sequentially selecting T bits comprise at least one of the following: from the order 1,2, ..., E 1 T IE1 column select bits, wherein
Figure PCTCN2018085645-appb-000327
1 ≤ E 1 ≤ C vb , ie1 and E 1 are integers; Tie 2 bits are selected in order from the E 2 , E 2 +1, ..., E 3 columns, wherein
Figure PCTCN2018085645-appb-000328
1 ≤ E 2 ≤ E 3 ≤ C re , ie2, E 2 and E 3 are integers; sequentially select Tie 3 bits from the E 4 , E 4 +1, ..., E vb columns, wherein
Figure PCTCN2018085645-appb-000329
1 ≤ E 4 ≤ C vb , ie3 and E 4 are integers.
需要说明的是，从第二比特序列矩阵中按行依次选取T个比特包括以下至少之一：依次从第1,2，…,F 1行选择T if1个比特，其中
Figure PCTCN2018085645-appb-000330
≤F 1≤R vb，if1和F 1为整数；依次从第F 2,F 2+1，…,F 3行选择T if2个比特，其中
Figure PCTCN2018085645-appb-000331
1≤F 2≤F 3≤R vb，if2，F 2和F 3为整数；依次从第F 4,F 4+1，…,R vb行选择T if3个比特，其中
Figure PCTCN2018085645-appb-000332
1≤F 4≤R vb，if3和F 4为整数。 It should be noted that selecting T bits in order from the second bit sequence matrix includes at least one of the following: sequentially selecting T if1 bits from the first, second, ..., F 1 rows, wherein
Figure PCTCN2018085645-appb-000330
≤ F 1 ≤ R vb , if1 and F 1 are integers; T if2 bits are sequentially selected from the F 2 , F 2 +1, ..., F 3 rows, wherein
Figure PCTCN2018085645-appb-000331
1≤F 2 ≤F 3 ≤R vb, if2 , F 2 and F 3 are integers; sequentially from the F 4, F 4 + 1, ..., R vb T if3 row selection bits, wherein
Figure PCTCN2018085645-appb-000332
1 ≤ F 4 ≤ R vb , if3 and F 4 are integers.
需要说明的是，从第二比特序列矩阵中按对角方式依次选取T个比特包括以下至少之一：依次从第-min(R vb,C re)+1,-min(R vb,C vb)+2，…,G 1条对角线选择T ig1个比特，其中，
Figure PCTCN2018085645-appb-000333
-min(R vb,C vb)+1≤G 1≤max(R vb,C vb)-1，ig1和G 1为整数；依次从第G 2,G 2+1，…,G 3条对角线选择K ig2个比特，其中
Figure PCTCN2018085645-appb-000334
-min(R vb,C vb)+1≤G 2≤G 3≤max(R vb,C vb)-1，ig2，G 2和G 3为整数；依次从第G 4,G 4+1，…,max(R vb,C vb)-1条对角线选择K id3个比特，其中
Figure PCTCN2018085645-appb-000335
-min(R vb,C vb)+1≤G 4≤max(R vb,C vb)-1，ig3和G 4为整数。 It should be noted that T bits are sequentially selected from the second bit sequence matrix in a diagonal manner including at least one of the following: sequentially from the -min(R vb , C re )+1, -min(R vb , C vb ) +2,...,G 1 diagonally selects T ig1 bits, where
Figure PCTCN2018085645-appb-000333
-min(R vb , C vb ) +1 ≤ G 1 ≤ max(R vb , C vb )-1, ig1 and G 1 are integers; sequentially from the G 2 , G 2 +1, ..., G 3 pairs Corner selects K ig2 bits, of which
Figure PCTCN2018085645-appb-000334
-min(R vb , C vb )+1≤G 2 ≤G 3 ≤max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers; sequentially from the G 4 , G 4 +1, ...,max(R vb ,C vb )-1 diagonally select K id3 bits, of which
Figure PCTCN2018085645-appb-000335
-min(R vb , C vb )+1≤G 4 ≤max(R vb , C vb )-1, ig3 and G 4 are integers.
需要说明的是，上述设备可以是终端，也可以是网络侧设备比如基站等，但并不限于此。It should be noted that the foregoing device may be a terminal, or may be a network side device such as a base station, but is not limited thereto.
实施例4Example 4
本申请的实施例还提供了一种存储介质，该存储介质包括存储的程序，其中，上述程序运行时执行上述任一项所述的方法。The embodiment of the present application further provides a storage medium including a stored program, wherein the program runs to perform the method described in any of the above.
本申请一实施方式中，在本实施例中，上述存储介质可以被设置为存储用于执行实施例1中的方法的步骤的程序代码。In an embodiment of the present application, in the present embodiment, the storage medium may be set to store program code for executing the steps of the method in Embodiment 1.
本申请一实施方式中，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存 储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。In an embodiment of the present application, in the embodiment, the storage medium may include, but is not limited to, a USB flash drive, a Read-Only Memory (ROM), and a Random Access Memory (Random Access Memory). A variety of media that can store program code, such as RAM), removable hard drives, disks, or optical disks.
本申请的实施例还提供了一种处理器，该处理器配置为运行程序，其中，该程序运行时执行上述任一项方法中的步骤。Embodiments of the present application also provide a processor configured to execute a program, wherein the program executes the steps of any of the above methods when executed.
本申请一实施方式中，在本实施例中，上述程序配置为执行实施例1中的方法的步骤。In an embodiment of the present application, in the embodiment, the program is configured to perform the steps of the method in Embodiment 1.
本申请一实施方式中，本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。In an embodiment of the present application, the specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the optional embodiments, and details are not described herein again.
为了更好的理解本申请，以下结合优选的实施例对本申请做进一步解释。For a better understanding of the present application, the present application is further explained in conjunction with the preferred embodiments.
优选实施例1Preferred embodiment 1
以下数值假设为表述方便，对于其他情形，仍可参考以下操作步骤。The following values are assumed to be convenient for presentation. For other situations, the following steps can still be referred to.
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；第一比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，具体编码过程如下： It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the first bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length Encoded for 128 polarization codes, the specific encoding process is as follows:
(1)索引矩阵M re的行数R re选择需满足R re×C re≥N的最小值，根据上述假设C re＝32，N＝128，则R re＝4。假设索引矩阵M og中索引按行排列，则 (1) Select the number of rows R re index matrix must meet a minimum value of M re R re × C re ≥N, according to the above assumptions C re = 32, N = 128 , then R re = 4. Assuming that the index in the index matrix M og is arranged in rows, then
Figure PCTCN2018085645-appb-000336
Figure PCTCN2018085645-appb-000336
(2)若索引矩阵M re由索引矩阵M or经过列置换得到，将索引矩阵M or的第π 1(i)列经过列置换映射到索引矩阵M re的第i列，从而得到索引矩阵M re，而π 1(i)中索引按照函数计算得到的数值结果升序排列。若函数表达 式为
Figure PCTCN2018085645-appb-000337
且k＝4，则{f(0),…,f(31)}＝{0,1,1.19,2.19,1.41,2.41,2.60,3.60,1.68,2.68,2.87,3.87,3.10,4.10,4.29,5.29,2.00,3.00,3.19,4.19,3.41,4.41,4.60,5.60,3.68,4.68,4.87,.87,5.10,6.10,6.29,7.29}，将f(0),…,f(31)从小到大排列得到列置换模式(pattern)为π 1(i)＝{0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31}，由此可以得到索引矩阵M or的索引为0的列即索引矩阵M re的索引为0的列，索引矩阵M or的索引为1的列即索引矩阵M re的索引为1的列，索引矩阵M or的索引为2的列即索引矩阵M re的索引为2的列，索引矩阵M or的索引为4的列即索引矩阵M re的索引为3的列，索引矩阵M or的索引为8的列即索引矩阵M re的索引为4的列，以此类推； (2) If the index matrix M Re obtained by the index of the matrix M or through column permutation, the first π index matrix M or the 1 (i) column after column permutation is mapped to the i th column index of the matrix M Re, resulting in the index matrix M Re , and the numerical results of the index calculated by the function in π 1 (i) are arranged in ascending order. If the function expression is
Figure PCTCN2018085645-appb-000337
And k=4, then {f(0),...,f(31)}={0,1,1.19, 2.19,1.41,2.41, 2.60, 3.60, 1.68, 2.68, 2.87, 3.87, 3.10, 4.10, 4.29 , 5.29, 2.00, 3.00, 3.19, 4.19, 3.41, 4.41, 4.60, 5.60, 3.68, 4.68, 4.87, .87, 5.10, 6.10, 6.29, 7.29}, f(0),...,f(31) from small To the large arrangement, the column permutation pattern is π 1 (i)={0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7, 24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31}, thereby obtaining a column whose index of the index matrix M or is 0, that is, an index matrix The index of M re is 0, the index of the index matrix M or is the column of index 1 of the index matrix M re , and the index of the index matrix M or 2 of the index matrix M re is 2 Column, the index of the index matrix M or 4, that is, the index of the index matrix M re is 3, the index of the index matrix M or 8 is the column of the index matrix M re index of 4, and so on. ;
(3)比特序列矩阵M vb由比特序列矩阵M og经过列置换得到，将比特序列矩阵M og的第π 2(i)列经过列置换映射到比特序列矩阵M vb的第i列，从而得到比特序列矩阵M vb，而π 2(i)＝BRO(i)，则列置换模式(pattern)为π 2(i)＝{0,16,8,24,4,20,12,28,2,18,10,26,6,22,14,30,1,17,9,25,5,21,13,29,3,19,11,27,7,23,15,31}，由此可以得到比特序列矩阵M og的索引为0的列即比特序列矩阵M vb的索引为0的列，比特序列矩阵M og的索引为16的列即比特序列矩阵M vb的索引为1的列，比特序列矩阵M og的索引为8的列为比特序列矩阵M vb的索引为2的列，以此类推； (3) a bit sequence matrix M vb after column permutation obtained by a bit sequence matrix M og, the bits of the π sequence matrix M og of 2 (i) column after column permutation is mapped to the i-th column of the bit sequence matrix M vb, resulting The bit sequence matrix M vb , and π 2 (i)=BRO(i), the column permutation pattern is π 2 (i)={0,16,8,24,4,20,12,28,2 , 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31} It is possible to obtain a column whose index of the bit sequence matrix M og is 0, that is, a column whose index of the bit sequence matrix M vb is 0, and a column whose index of the bit sequence matrix M og is 16 is a column whose index of the bit sequence matrix M vb is 1. The column whose index of the bit sequence matrix M og is 8 is a column whose index of the bit sequence matrix M vb is 2, and so on;
(4)从比特序列矩阵M vb中按列选择最前面T＝100个比特组成待发送比特序列，得到待发送比特序列为{y 0,y 32,y 64,y 96,y 16,y 48,y 80,y 112,…,y 23,y 55,y 87,y 119}； (4) Selecting the first T=100 bits from the bit sequence matrix M vb to form a bit sequence to be transmitted, and obtaining a bit sequence to be transmitted is {y 0 , y 32 , y 64 , y 96 , y 16 , y 48 , y 80 , y 112 ,...,y 23 ,y 55 ,y 87 ,y 119 };
(5)从索引矩阵M re按行总共选取K＝40个索引组成索引序列M_index，其中需要注意的是选取索引时需要跳过为发送比特序列对应的索引，也就是从步骤(4)中待发送比特序列对应编码器输出的索引中选取； (5) A total of K=40 indexes are selected from the index matrix M re to form an index sequence M_index, wherein it is necessary to note that the index corresponding to the transmitted bit sequence needs to be skipped when the index is selected, that is, from step (4). The transmission bit sequence is selected from the index corresponding to the output of the encoder;
(6)将长度为K的输入比特序列映射到索引序列M_index所指示的编码器位置后，进行极化码编码，得到长度为N＝128的编码后比特序列，将步骤(4)中确定的比特组成待发送比特序列，从发射端发送出去。(6) After mapping the input bit sequence of length K to the encoder position indicated by the index sequence M_index, performing polarization code encoding to obtain a coded bit sequence of length N=128, which is determined in step (4). The bits form a sequence of bits to be transmitted and are transmitted from the transmitting end.
优选实施例2Preferred embodiment 2
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，具体编码过程与优选实施例1不同的是步骤(4)中，从比特序列矩阵M vb中按列选择最后T＝100个比特组成待发送比特序列，得到待发送比特序列为{y 8,y 24,y 40,y 56,y 72,y 88,y 104,y 120,…,y 15,y 31,y 47,y 63,y 79,y 95,y 111,y 127}。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length is Different from the preferred embodiment 1, in step (4), the last T=100 bits are selected from the bit sequence matrix M vb to form a bit sequence to be transmitted, and the bit to be transmitted is obtained. The sequence is {y 8 , y 24 , y 40 , y 56 , y 72 , y 88 , y 104 , y 120 , . . . , y 15 , y 31 , y 47 , y 63 , y 79 , y 95 , y 111 , y 127 }.
优选实施例3Preferred embodiment 3
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝150，采用母码长度为128的极化码编码，具体编码过程与优选实施例1不同的是步骤(4)中，从比特序列矩阵M vb中第一个元素开始按行选择T＝130个比特组成待发送比特序列，取到缓存或比特序列矩阵M vb最后一个比特y 127，则跳转到比特序列矩阵M vb第一个比特y 0继续选取，得到待发送比特序列为{y 0,y 1,y 2,…,y 127,y 0,y 1,y 2}。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=150, and the mother code length is The polarization code code of 128 is different from the preferred embodiment 1. In step (4), T=130 bits are selected from the first element of the bit sequence matrix M vb to form a to-be-transmitted bit sequence. If the last bit y 127 of the buffer or bit sequence matrix M vb is obtained , the jump to the first bit y 0 of the bit sequence matrix M vb continues to be selected, and the bit sequence to be transmitted is obtained as {y 0 , y 1 , y 2 ,... , y 127 , y 0 , y 1 , y 2 }.
优选实施例4Preferred embodiment 4
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝150，采用母码长度为128的极化码编码，具体编码过程与优选实施例3不同的是步骤(4)中，从比特序列矩阵M vb中最后一个元素开始按行选择T＝130个比特组成待发送比特序列，取到缓存或比特序列矩阵M vb第一个比特y 0，则跳转到比特序列矩阵M vb最后一个比特y 127继续选取，得到待发送比特 序列为{y 0,y 1,y 2,…,y 127,y 127,y 126,y 125}。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=150, and the mother code length is The polarization code code of 128 is different from the preferred embodiment 3. In step (4), the bit sequence to be transmitted is formed by selecting T=130 bits in a row from the last element in the bit sequence matrix M vb . To the first bit y 0 of the buffer or bit sequence matrix M vb , the jump to the last bit y 127 of the bit sequence matrix M vb continues to be selected, and the bit sequence to be transmitted is obtained as {y 0 , y 1 , y 2 , ..., y 127 , y 127 , y 126 , y 125 }.
优选实施例5Preferred embodiment 5
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，编码过程与优选实施例1不同的是：将长度K＝40的输入比特序列映射到编码器位置采用的是高斯近似(Gaussian approximation)/密度演进(Density evolution)/PW序列(PW sequence)/FRANK序列(FRANK sequence)等其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 1 in that the input bit sequence of length K=40 is mapped to the encoder position using Gaussian approximation/density evolution/PW Other methods such as sequence (PW sequence)/FRANK sequence (FRANK sequence), the specific operation steps will not be described again.
优选实施例6Preferred embodiment 6
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，编码过程与优选实施例2不同的是：将长度K＝40的输入比特序列映射到编码器位置采用的是高斯近似(Gaussian approximation)/密度演进(Density evolution)/PW序列(PW sequence)/FRANK序列(FRANK sequence)等其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 2 in that the input bit sequence of length K=40 is mapped to the encoder position using Gaussian approximation/density evolution/PW Other methods such as sequence (PW sequence)/FRANK sequence (FRANK sequence), the specific operation steps will not be described again.
优选实施例7Preferred embodiment 7
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝130，采用母码长度为128的极化码编码，具体编码过程与优选实施例3不同的是：将长度K＝40的输入比特序列映射到编码器位置采用的是高斯近似(Gaussian approximation)/密度演进(Density evolution)/PW序列(PW sequence)/FRANK序列(FRANK sequence)等其他方法。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=130, and the mother code length is The polarization code encoding of 128 is different from the preferred embodiment 3 in that the input bit sequence of length K=40 is mapped to the encoder position using Gaussian approximation/density evolution/ Other methods such as PW sequence/FRANK sequence.
优选实施例8Preferred embodiment 8
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝130，采用母码长度为128的极化码编码，编码过程与优选实施例4不同的是：将长度K＝40的输入比特序列映射到编码器位置采用的是高斯近似(Gaussian approximation)/密度演进(Density evolution)/PW序列(PW sequence)/FRANK序列(FRANK sequence)等其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=130, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 4 in that the input bit sequence of length K=40 is mapped to the encoder position using Gaussian approximation/density evolution/PW Other methods such as sequence (PW sequence)/FRANK sequence (FRANK sequence), the specific operation steps will not be described again.
优选实施例9Preferred embodiment 9
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，编码过程与优选实施例1不同的是：速率匹配采用的是其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 1. The rate matching uses other methods, and the specific operation steps are not described again.
优选实施例10Preferred embodiment 10
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝100，采用母码长度为128的极化码编码，编码过程与优选实施例2不同的是：速率匹配采用的是其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=100, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 2. The rate matching uses other methods, and the specific operation steps are not described again.
优选实施例11Preferred embodiment 11
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝130，采用母码长度为128的极化码编码，编码过程与优选实施例3不同的是：速率匹配采用的是其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=130, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 3. The rate matching uses other methods, and the specific operation steps are not described again.
优选实施例12Preferred embodiment 12
假设索引矩阵M or、索引矩阵M re，比特序列矩阵M vb和比特序列矩阵M og的列数固定为32；输入比特序列长度K＝40，发送比特序列长度T＝130， 采用母码长度为128的极化码编码，编码过程与优选实施例4不同的是：速率匹配采用的是其他方法，具体操作步骤不再赘述。 It is assumed that the index matrix M or , the index matrix M re , the bit sequence matrix M vb and the bit sequence matrix M og have a fixed number of columns; the input bit sequence length K=40, the transmission bit sequence length T=130, and the mother code length is The polarization code encoding of 128 is different from that of the preferred embodiment 4. The rate matching uses other methods, and the specific operation steps are not described again.
显然，本领域的技术人员应该明白，上述的本申请的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本申请不限制于任何特定的硬件和软件结合。Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, which can be concentrated on a single computing device or distributed in a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module. Thus, the application is not limited to any particular combination of hardware and software.
以上所述仅为本申请的优选实施例而已，并不用于限制本申请，对于本领域的技术人员来说，本申请可以有各种更改和变化。凡在本申请的原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。The above description is only the preferred embodiment of the present application, and is not intended to limit the present application, and various changes and modifications may be made to the present application. Any modifications, equivalent substitutions, improvements, etc. made within the principles of this application are intended to be included within the scope of the present application.
工业实用性Industrial applicability
采用本申请，将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将第二比特序列进行极化码编码，得到极化码编码后比特序列；从极化码编码后比特序列中选取T个比特作为待发送比特序列，即本申请提供了一种待发送比特序列的确定方法，因而解决了上述相关技术中5G New RAT中没有相应的序列确定方法的问题。According to the application, the first bit sequence of length K bits is mapped to the specified position according to M_index to obtain a second bit sequence; the second bit sequence is subjected to polarization code encoding to obtain a bit sequence after polarization code encoding; The T-bits are selected as the to-be-transmitted bit sequence in the bit-coded bit sequence, that is, the present application provides a method for determining a bit sequence to be transmitted, thereby solving the above-mentioned related art that there is no corresponding sequence determining method in the 5G New RAT. problem.

Claims (38)

  1. 一种序列确定方法，包括：A method for determining a sequence, comprising:
    将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；Mapping a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence;
    将所述第二比特序列进行极化码编码，得到极化码编码后比特序列；Performing polarization code encoding on the second bit sequence to obtain a bit sequence after polarization code encoding;
    从所述极化码编码后比特序列中选取T个比特作为待发送比特序列；Selecting T bits from the bit sequence after the polarization code encoding as a bit sequence to be transmitted;
    其中，K和T均为正整数，K≤T。Where K and T are positive integers, K ≤ T.
  2. 根据权利要求1所述的方法，其中，在将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列之前，所述方法还包括：The method according to claim 1, wherein before the first bit sequence of length K bits is mapped to the specified position according to the M_index to obtain the second bit sequence, the method further comprises:
    将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过所述第二索引矩阵得到所述M_index；其中，所述第一预定变换包括：行置换或者列置换。And dividing the first index matrix by the first predetermined transform to obtain the second index matrix; obtaining the M_index by using the second index matrix; wherein the first predetermined transform comprises: row permutation or column permutation.
  3. 根据权利要求1或2所述的方法，其中，在从所述极化码编码后比特序列中选取T个比特作为待发送比特序列之前，所述方法还包括：将所述极化码编码后比特序列组成第一比特序列矩阵；将所述第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，所述第二预定变换包括：行置换或者列置换；The method according to claim 1 or 2, wherein, before selecting the T bits from the bit code sequence after the polarization code encoding as the bit sequence to be transmitted, the method further comprises: encoding the polarization code The bit sequence is formed into a first bit sequence matrix; the first bit sequence matrix is subjected to a second predetermined transform to obtain a second bit sequence matrix; wherein the second predetermined transform comprises: a row permutation or a column permutation;
    从所述极化码编码后比特序列中选取T个比特作为待发送比特序列包括：从所述第二比特序列矩阵中选取所述T个比特作为所述待发送比特序列。Selecting T bits from the bit sequence after the polarization code encoding as the bit sequence to be transmitted includes: selecting the T bits from the second bit sequence matrix as the bit sequence to be transmitted.
  4. 根据权利要求2所述的方法，其中，所述第二索引矩阵为M re，所述M re为R re行C re列的矩阵，所述第一索引矩阵为M or，所述M or为
    Figure PCTCN2018085645-appb-100001
    或者，     The method according to claim 2, wherein the second index matrix is M re , the M re is a matrix of R re rows C re columns, the first index matrix is M or , and the M or
    Figure PCTCN2018085645-appb-100001
    or,
    Figure PCTCN2018085645-appb-100002
    Figure PCTCN2018085645-appb-100002
    其中，R re×C re≥N，R re和C re均为正整数；所述N为所述极化码编码后比特序列的长度。 Where R re × C re ≥ N, R re and C re are both positive integers; and N is the length of the bit sequence after encoding the polarization code.
  5. 根据权利要求4所述的方法，其中，在所述R re不变的情况下，所述C re为满足R re×C re≥N的最小值；或者，在所述C re不变的情况下，所述R re为满足R re×C re≥N的最小值。 The method according to claim 4, wherein, in the case where said R re is constant, said C re is a minimum value satisfying R re × C re ≥ N; or, in the case where said C re is constant Next, the R re is a minimum value satisfying R re ×C re ≥N.
  6. 根据权利要求4所述的方法，其中，将所述第一索引矩阵经过所述第一预定变换得到第二索引矩阵包括以下至少之一：The method of claim 4, wherein the first index matrix is subjected to the first predetermined transform to obtain a second index matrix comprising at least one of the following:
    所述M re的第i列为所述M or的第π 1(i)列经过列置换得到的,其中，0≤i≤C re-1，0≤π 1(i)≤C re-1，R re×C re≥N，i和π 1(i)均为正整数； The i-th M re as the first M or π 1 (i) of the column after column permutation obtained, wherein, 0≤i≤C re -1,0≤π 1 (i) ≤C re -1 , R re ×C re ≥N,i and π 1 (i) are both positive integers;
    所述M re的第j行为所述M or的第π 2(j)行经过行置换得到的,其中，0≤j≤R re-1，0≤π 2(j)≤R re-1，R re×C re≥N，j和π 2(j)均为正整数。 The j M re behavior of the M or π 2 (j) rows through row permutation obtained, wherein, 0≤j≤R re -1,0≤π 2 (j) ≤R re -1, R re ×C re ≥N,j and π 2 (j) are both positive integers.
  7. 根据权利要求6所述的方法，其中，所述π 1(i)通过以下至少之一方式获取： The method of claim 6, wherein the π 1 (i) is obtained by at least one of:
    π 1(i)＝BRO(i)，其中，BRO()表示比特反序操作，所述比特反序操作包括：将十进制数i转换为第一二进制数(B n1-1,B n1-2,…,B 0)，将所述第一二进制数反序排列得到第二二进制数(B 0,B 1,…,B n1-1)，再将所述第二二进制数转换成十进制数得到π 1(i)，其中，n1＝log 2(C re)，0≤i≤C re-1； π 1 (i)=BRO(i), wherein BRO() represents a bit reverse order operation, the bit reverse order operation comprising: converting a decimal number i into a first binary number (B n1-1 , B n1 -2 , ..., B 0 ), arranging the first binary numbers in reverse order to obtain a second binary number (B 0 , B 1 , ..., B n1-1 ), and then the second two Converting a hexadecimal number to a decimal number yields π 1 (i), where n1=log 2 (C re ), 0 ≤ i ≤ C re -1;
    π 1(i)＝{S1,S2,S3}，其中，S1＝{0,1,…,i1-1}，S2＝{i2,i3,i2+1,i3+1,…,i4,i5}，S3为{0,1,…,C re-1}中除了所述S1包含的元素和所述S2包含的元素之外的其他元素组成的集合，其中，C re/8≤i1≤i2≤C re/3,i2≤i4≤i3≤2C re/3,i3≤i5≤C re-1，其中，i1、i2、i3、i4和i5均为正整数，且所述S1，所述S2与所述S3任意两者的交集为空集； π 1 (i)={S1, S2, S3}, where S1={0,1,...,i1-1}, S2={i2,i3,i2+1,i3+1,...,i4,i5 }, S3 is a set of {0, 1, ..., C re -1} other than the element included in the S1 and the element included in the S2, wherein C re /8 ≤ i1 ≤ i2 ≤C re / 3, i2≤i4≤i3≤2C re / 3, i3≤i5≤C re -1, wherein, i1, i2, i3, i4 and i5 are positive integers, and the Sl, S2 of the The intersection with any of the S3 is an empty set;
    π 1(i)＝{I}，其中，序列{I}由所述M or的列索引r按照函数f(r)计算得到的数值结果升序或降序顺序排列得到，0≤r≤C re-1，所述f(r)具有单调性。 π 1 (i) = {I }, where the sequence {I} is obtained from the r M or column index is calculated as a function f (r) the numerical results obtained in ascending or descending order, 0≤r≤C re - 1. The f(r) has monotonicity.
  8. 根据权利要求7所述的方法，其中，所述f(r)包括以下至少之一：The method of claim 7, wherein the f(r) comprises at least one of:
    Figure PCTCN2018085645-appb-100003
    (B n1-1,B n1-2,…,B 0)为索引r的二进制表示，0≤m1≤n1-1，n1＝log 2(C re)，k为正整数；
    Figure PCTCN2018085645-appb-100003
    (B n1-1, B n1-2, ... , B 0) of the binary representation of the index r, 0≤m1≤n1-1, n1 = log 2 ( C re), k is a positive integer;
    将r对应的函数值初始化为f 1 (r)，在所述f 1 (r)的基础上按照第一迭代公式进行n1次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100004
    其中,所述第一迭代计算公式为
    Figure PCTCN2018085645-appb-100005
    其中，f 1 (r)为r处的对数似然比均值；     Initializing the function value corresponding to r as f 1 (r) , and performing n1 iterations update according to the first iteration formula on the basis of the f 1 (r) , obtaining the function value of each element
    Figure PCTCN2018085645-appb-100004
    Wherein the first iteration calculation formula is
    Figure PCTCN2018085645-appb-100005
    Where f 1 (r) is the log likelihood ratio mean at r;
    将r对应的函数值初始化为f 1 (r)，然后在所述f 1 (r)的基础上按照第二迭代公式进行n1次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100006
    其中，所述第二迭代计算公式为
    Figure PCTCN2018085645-appb-100007
    f 1 (r)为r处的互信息；     After the r value is initialized to the corresponding function f 1 (r), and then iteratively updated according to the second n1 times based on the iterative formula f 1 (r) based on a function value of each element
    Figure PCTCN2018085645-appb-100006
    Wherein the second iteration calculation formula is
    Figure PCTCN2018085645-appb-100007
    f 1 (r) is the mutual information at r;
    其中，1≤m2≤n1，1≤m3≤n1，r1,r2,2r和2r-1均为大于或者等于0且小于或者等于C re-1的整数。 Wherein, 1≤m2≤n1, 1≤m3≤n1, r1, r2, 2r and 2r-1 are integers greater than or equal to 0 and less than or equal to C re -1.
  9. 根据权利要求6所述的方法，其中，所述π 2(j)通过以下至少之一方式获取： The method of claim 6, wherein the π 2 (j) is obtained by at least one of the following:
    π 2(j)＝BRO(j)，其中，BRO()表示比特反序操作，所述比特反序操作包括：将十进制数j转换为第三二进制数(B n2-1,B n2-2,…,B 0)，将所述第三二进制数反序排列得到第四二进制数(B 0,B 1,…,B n2-1)，再将所述第四二进制数转换成十进制数得到π 2(j)，其中，n2＝log 2(R re)，0≤j≤R re-1； π 2 (j)=BRO(j), wherein BRO() represents a bit reverse order operation, the bit reverse order operation comprising: converting a decimal number j into a third binary number (B n2-1 , B n2 -2 , ..., B 0 ), the third binary numbers are arranged in reverse order to obtain a fourth binary number (B 0 , B 1 , ..., B n2-1 ), and then the fourth two Converting a hexadecimal number to a decimal number yields π 2 (j), where n2=log 2 (R re ), 0 ≤ j ≤ R re -1;
    π 2(j)＝{S4,S5,S6}，其中，S4＝{0,1,…,j1-1}，S5＝{j2,j3,j2+1,j3+1,…,j4,j5}，S6为{0,1,…,R re-1}中除了所述S4包含的元素和所述S5包含的元素之外的其他元素组成的集合，其中，R re/8≤j1≤j2≤R re/3,j2≤j4≤j3≤2R re/3,j3≤j5≤R re-1，其中，j1、j2、j3、j4和j5均为正整数，且所述S4，所述S5与所述S6任意两者的交集为空集； π 2 (j)={S4, S5, S6}, where S4={0,1,...,j1-1}, S5={j2,j3,j2+1,j3+1,...,j4,j5 }, S6 is a set of {0, 1, ..., R re -1} other than the element included in the S4 and the element included in the S5, wherein R re /8 ≤ j1 ≤ j2 ≤R re / 3, j2≤j4≤j3≤2R re / 3, j3≤j5≤R re -1, wherein, j1, j2, j3, j4 and j5 are positive integers and the S4, S5 the The intersection with any of the S6 is an empty set;
    π 2(j)＝{J}，其中，序列{J}中由所述M or的行索引s按照函数f(s)计算得到的数值结果升序或降序顺序排列得到，0≤s≤R re-1，所述f(s)具有单调性。 π 2 (j) = {J }, wherein the numerical result sequence ascending or descending order by {J} of the M or row index s in accordance with the function f (s) calculated to give arrangement, 0≤s≤R re -1, the f(s) is monotonic.
  10. 根据权利要求9所述的方法，其中，所述f(s)包括以下至少之一：The method of claim 9 wherein said f(s) comprises at least one of:
    Figure PCTCN2018085645-appb-100008
    (B n2-1,B n2-2,…,B 0)为索引s的二进制表示，0≤m4≤n2-1，n2＝log 2(R re)，k为正整数；
    Figure PCTCN2018085645-appb-100008
    (B n2-1, B n2-2, ... , B 0) is the binary representation of the index s, 0≤m4≤n2-1, n2 = log 2 ( R re), k is a positive integer;
    将s对应的函数值初始化为f 1 (s)，在所述f 1 (s)的基础上按照第三迭代公式进行n2次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100009
    其中,所述第三迭代计算公式为
    Figure PCTCN2018085645-appb-100010
    其中，f 1 (s)为s处的对数似然比均值；     Initializing the function value corresponding to s to f 1 (s) , and performing n2 iterations update according to the third iteration formula on the basis of the f 1 (s) , obtaining the function value of each element
    Figure PCTCN2018085645-appb-100009
    Wherein the third iteration calculation formula is
    Figure PCTCN2018085645-appb-100010
    Where f 1 (s) is the log likelihood ratio mean at s;
    将s对应的函数值初始化为f 1 (s)，然后在所述f 1 (s)的基础上按照第四 迭代公式进行n2次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100011
    其中，所述第四迭代计算公式为
    Figure PCTCN2018085645-appb-100012
    其中，f 1 (s)为s处的互信息；     After the value s is initialized to the corresponding function f 1 (s), and then iteratively updated according to the fourth n2 times on the basis of the iterative equation f 1 (s) based on the function value of each element
    Figure PCTCN2018085645-appb-100011
    Wherein the fourth iteration calculation formula is
    Figure PCTCN2018085645-appb-100012
    Where f 1 (s) is the mutual information at s;
    其中，1≤m5≤n2，1≤m6≤n2，s1,s2,2s和2s-1均为大于或者等于0且小于或者等于R re-1的整数。 Wherein, 1 ≤ m5 ≤ n2, 1 ≤ m6 ≤ n2, s1, s2, 2s and 2s-1 are integers greater than or equal to 0 and less than or equal to R re -1.
  11. 根据权利要求3所述的方法，其中，所述第一比特序列矩阵为M og，所述第二比特序列矩阵为M vb，所述M vb为R vb行C vb列的矩阵，所述M og为 The method according to claim 3, wherein said first bit sequence matrix is M og , said second bit sequence matrix is M vb , said M vb being a matrix of R vb row C vb columns, said M Og is
    Figure PCTCN2018085645-appb-100013
    或者，
    Figure PCTCN2018085645-appb-100013
    or,
    Figure PCTCN2018085645-appb-100014
    Figure PCTCN2018085645-appb-100014
    其中，x 0,x 1,x 2,…,
    Figure PCTCN2018085645-appb-100015
    为所述极化码编码后比特序列，R vb×C vb≥N,R vb和C vb均为正整数，N为所述极化码编码后比特序列的长度。     Where x 0 , x 1 , x 2 ,...,
    Figure PCTCN2018085645-appb-100015
    For the bit sequence encoded by the polarization code, R vb × C vb ≥ N, R vb and C vb are both positive integers, and N is the length of the bit sequence after encoding the polarization code.
  12. 根据权利要求11所述的方法，其中，在所述R vb不变的情况下，所述C vb为满足R vb×C vb≥N的最小值；或者，在所述C vb不变的情况下，所述R vb为满足R vb×C vb≥N的最小值。 The method according to claim 11, wherein, in the case where said R vb is constant, said C vb is a minimum value satisfying R vb × C vb ≥ N; or, in the case where said C vb is constant Next, the R vb is a minimum value satisfying R vb × C vb ≥ N.
  13. 根据权利要求11所述的方法，其中，将所述第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵包括以下至少之一：The method according to claim 11, wherein the first bit sequence matrix is subjected to a second predetermined transform to obtain a second bit sequence matrix comprising at least one of the following:
    所述M vb的第g列为所述M og的第π 3(g)列经过列置换得到的，其 中，0≤g≤C vb-1，0≤π 3(g)≤C vb-1，R vb×C vb≥N，g和π 3(g)均为正整数； G M vb of the second as of the first π M og 3 (g) column obtained after column permutation, wherein, 0≤g≤C vb -1,0≤π 3 (g) ≤C vb -1 , R vb × C vb ≥ N, g and π 3 (g) are positive integers;
    所述M vb的第h行为所述M og的第π 4(h)行经过行置换得到的，其中，0≤h≤R vb-1，0≤π 4(h)≤R vb-1，R vb×C vb≥N，h和π 4(h)均为正整数。 M h VB of the behavior of the first π og the M 4 (h) through the line row permutation obtained, wherein, 0≤h≤R vb -1,0≤π (h) 4 ≤R vb -1, R vb × C vb ≥ N, h and π 4 (h) are both positive integers.
  14. 根据权利要求13所述的方法，其中，所述π 3(g)通过以下至少之一方式获取： The method of claim 13, wherein the π 3 (g) is obtained by at least one of the following:
    π 3(g)＝BRO(g)，其中，BRO()表示比特反序操作，所述比特反序操作包括：将十进制数g转换为第五二进制数(B n3-1,B n3-2,…,B 0)，将所述第五二进制数反序排列得到第六二进制数(B 0,B 11,…,B n3-1)，再将所述第六二进制数转换成十进制数得到π 3(g)，其中，n3＝log 2(C vb)，0≤g≤C vb-1； π 3 (g)=BRO(g), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: converting a decimal number g to a fifth binary number (B n3-1 , B n3 -2 , ..., B 0 ), the fifth binary numbers are arranged in reverse order to obtain a sixth binary number (B 0 , B 11 , ..., B n3-1 ), and then the sixth two Converting a hexadecimal number to a decimal number yields π 3 (g), where n3 = log 2 (C vb ), 0 ≤ g ≤ C vb -1;
    π 3(g)＝{S1,S2,S3}，其中，S1＝{0,1,…,g1-1}，S2＝{g2,g3,g2+1,g3+1,…,g4,g5}，S3为{0,1,…,C vb-1}中除了所述S1包含的元素和所述S2包含的元素之外的其他元素组成的集合，其中，C vb/8≤g1≤g2≤C vb/3,g2≤g4≤g3≤2C vb/3,g3≤g5≤C vb-1，其中，g1、g2、g3、g4和g5均为正整数，且所述S1，所述S2与所述S3任意两者的交集为空集； π 3 (g)={S1, S2, S3}, where S1={0,1,...,g1-1},S2={g2,g3,g2+1,g3+1,...,g4,g5 }, S3 is a set of {0, 1, ..., C vb -1} other than the element included in the S1 and the element included in the S2, wherein C vb /8 ≤ g1 ≤ g2 ≤C vb / 3, g2≤g4≤g3≤2C vb / 3, g3≤g5≤C vb -1, wherein, g1, g2, g3, g4 and g5 are positive integers, and the Sl, S2 of the The intersection with any of the S3 is an empty set;
    π 3(g)＝{G}，其中，序列{G}由所述M og的列索引α按照函数f(α)计算得到的数值结果升序或降序顺序排列得到，0≤α≤C vb-1，所述f(α)具有单调性； π 3 (g) = {G }, wherein {G} the sequence obtained from the [alpha] M og column index calculated as a function f (α) in ascending or descending numerical order results obtained, 0≤α≤C vb - 1, the f(α) is monotonic;
    π 3(g)＝{Q1,Q2,Q3},其中，Q2＝{q1,q2,q1+1,q2+1,…,q3,q4}，其中0≤q1<q3≤(C vb-1)/2,0≤q2<q4≤(C vb-1)/2,q1,q2,q3和q4均为正整数,Q1和Q3为{0,1，…，C vb-1}与Q2差集中的其他元素，且Q1,Q2,Q3任意两者的交集为空集； π 3 (g)={Q1, Q2, Q3}, where Q2={q1,q2,q1+1,q2+1,...,q3,q4}, where 0≤q1<q3≤(C vb -1 )/2,0≤q2<q4≤(C vb -1)/2, q1,q2,q3 and q4 are positive integers, Q1 and Q3 are {0,1,...,C vb -1} and Q2 difference Other elements in the set, and the intersection of any two of Q1, Q2, and Q3 is an empty set;
    在nV1个相同位置上π 3(g)与预定义序列V1的元素不同，其中，V1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21, 22,25,26,28,23,27,29,30,31}，0≤nV1≤23； π 3 (g) is different from the element of the predefined sequence V1 at the same position of nV1, where V1={0,1,2,3,4,5,6,7,8,9,10,11,12 , 16, 13, 17, 14, 18, 15, 19, 20, 24, 21, 22, 25, 26, 28, 23, 27, 29, 30, 31}, 0 ≤ nV1 ≤ 23;
    在nV2个相同位置上π 3(g)与预定义序列V2的元素不同，其中，V2＝{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}，0≤nV2≤3。 π 3 (g) is different from the elements of the predefined sequence V2 at n2 identical positions, where V2 = {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}, 0 ≤ nV2 ≤ 3.
  15. 根据权利要求14所述的方法，其中，所述f(α)包括以下至少之一：The method of claim 14, wherein the f(α) comprises at least one of the following:
    Figure PCTCN2018085645-appb-100016
    (B n3-1,B n3-2,…,B 0)为索引α的二进制表示，0≤m6≤n3-1，n3＝log 2(C vb)，k为正整数；
    Figure PCTCN2018085645-appb-100016
    (B n3-1 , B n3-2 , . . . , B 0 ) is a binary representation of the index α, 0≤m6≤n3-1, n3=log 2 (C vb ), and k is a positive integer;
    将α对应的函数值初始化为f 1 (α)，在所述f 1 (α)的基础上按照第五迭代公式进行n3次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100017
    其中,所述第五迭代计算公式为
    Figure PCTCN2018085645-appb-100018
    其中，f 1 (α)为r处的对数似然比均值；     Initializing the function value corresponding to α to f 1 (α) , and performing n3 iterations update according to the fifth iteration formula on the basis of the f 1 (α) , obtaining the function value of each element
    Figure PCTCN2018085645-appb-100017
    Wherein the fifth iteration calculation formula is
    Figure PCTCN2018085645-appb-100018
    Where f 1 (α) is the log likelihood ratio mean at r;
    将α对应的函数值初始化为f 1 (α)，然后在所述f 1 (α)的基础上按照第六迭代公式进行n3次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100019
    其中，所述第六迭代计算公式为
    Figure PCTCN2018085645-appb-100020
    f 1 (α)为r处的互信息；     After [alpha] is initialized to a value corresponding to the function f 1 (α), and then iteratively updated according to a sixth n3 times based on the iterative formula f 1 (α), based on a function value of each element
    Figure PCTCN2018085645-appb-100019
    Wherein the sixth iteration calculation formula is
    Figure PCTCN2018085645-appb-100020
    f 1 (α) is mutual information at r;
    其中，1≤m7≤n3，1≤m8≤n3，α1,α2,2α和2α-1均为大于或者等于0且小于或者等于C vb-1的整数。 Wherein, 1≤m7≤n3, 1≤m8≤n3, α1, α2, 2α and 2α-1 are integers greater than or equal to 0 and less than or equal to C vb -1 .
  16. 根据权利要求13所述的方法，其中，所述π 4(h)通过以下至少之一方式获取： The method of claim 13, wherein the π 4 (h) is obtained by at least one of the following:
    π 4(h)＝BRO(h)，其中，BRO()表示比特反序操作，所述比特反 序操作包括：将十进制数h转换为第七二进制数(B n4-1,B n4-2,…,B 0)，将所述第七二进制数反序排列得到第八二进制数(B 0,B 1,…,B n4-1)，再将所述第八二进制数转换成十进制数得到π 4(h)，其中，n4＝log 2(R vb)，0≤h≤R vb-1； π 4 (h)=BRO(h), wherein BRO() represents a bit reverse order operation, and the bit reverse order operation includes: converting a decimal number h into a seventh binary number (B n4-1 , B n4 -2 , ..., B 0 ), the seventh binary number is arranged in reverse order to obtain an eighth binary number (B 0 , B 1 , ..., B n4-1 ), and then the eighth two Converting a hexadecimal number to a decimal number yields π 4 (h), where n4=log 2 (R vb ), 0 ≤ h ≤ R vb -1;
    π 4(h)＝{S4,S5,S6}，其中，S4＝{0,1,…,h1-1}，S5＝{h2,h3,h2+1,h3+1,…,h4,h5}，S6为{0,1,…,R vb-1}中除了所述S4包含的元素和所述S5包含的元素之外的其他元素组成的集合，其中，R vb/8≤h1≤h2≤R vb/3,h2≤h4≤h3≤2R vb/3,h3≤h5≤R vb-1，其中，h1、h2、h3、h4和h5均为正整数，且所述S4，所述S5与所述S6任意两者的交集为空集； π 4 (h)={S4, S5, S6}, where S4={0,1,...,h1-1}, S5={h2,h3,h2+1,h3+1,...,h4,h5 }, S6 is a set of {0, 1, ..., R vb -1} other than the element included in the S4 and the element included in the S5, wherein R vb /8 ≤ h1 ≤ h2 ≤R vb / 3, h2≤h4≤h3≤2R vb / 3, h3≤h5≤R vb -1, wherein, h1, h2, h3, h4 and h5 are positive integers and the S4, S5 the The intersection with any of the S6 is an empty set;
    π 4(h)＝{H}，其中，序列{H}中由所述M og的行索引β按照函数f(β)计算得到的数值结果升序或降序顺序排列得到，0≤β≤R vb-1，所述f(β)具有单调性； π 4 (h) = {H }, wherein the numerical result sequence {H} by the row index M og beta] according to a function f (β) calculated to give an ascending or descending order, 0≤β≤R vb -1, the f(β) is monotonic;
    π 4(h)＝{O1,O2,O3},其中，O2＝{o1,o2,o1+1,o2+1,…,o3,o4}，其中0≤o1<o3≤(R vb-1)/2,0≤o2<o4≤(R vb-1)/2,o1,o2,o3和o4均为正整数,O1和O3为{0,1，…，R vb-1}与O2差集中的其他元素，且O1,O2,O3任意两者的交集为空集； π 4 (h)={O1, O2, O3}, where O2={o1,o2,o1+1,o2+1,...,o3,o4}, where 0≤o1<o3≤(R vb -1 )/2,0≤o2<o4≤(R vb -1)/2,o1,o2,o3 and o4 are positive integers, and O1 and O3 are {0,1,...,R vb -1} are different from O2 Other elements in the set, and the intersection of any two of O1, O2, O3 is an empty set;
    在nVV1个相同位置上π 4(h)与预定义序列VV1的元素不同，其中VV1＝{0,1,2,3,4,5,6,7,8,9,10,11,12,16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}，0≤nVV1≤23； π 4 (h) is different from the elements of the predefined sequence VV1 at the same position of nVV, where VV1={0,1,2,3,4,5,6,7,8,9,10,11,12, 16,13,17,14,18,15,19,20,24,21,22,25,26,28,23,27,29,30,31}, 0≤nVV1≤23;
    在nVV2个相同位置上π 4(h)与预定义序列VV2的元素不同，其中VV2＝{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}，0≤nVV2≤3。 π 4 (h) is different from the elements of the predefined sequence VV2 at two identical positions of nVV, where VV2 = {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}, 0 ≤ nVV2 ≤ 3.
  17. 根据权利要求16所述的方法，其中，所述f(β)包括以下至少之一：The method of claim 16 wherein said f(β) comprises at least one of:
    Figure PCTCN2018085645-appb-100021
    (B n4-1,B n4-2,…,B 0)为索引β的二进制表示，0 ≤m9≤n4-1，n4＝log 2(R vb)，k为正整数；
    Figure PCTCN2018085645-appb-100021
    (B n4-1 , B n4-2 , . . . , B 0 ) is a binary representation of the index β, 0 ≤ m9 ≤ n4-1, n4 = log 2 (R vb ), and k is a positive integer;
    将β对应的函数值初始化为f 1 (β)，在所述f 1 (β)的基础上按照第七迭代公式进行n4次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100022
    其中,所述第七迭代计算公式为
    Figure PCTCN2018085645-appb-100023
    其中，f 1 (β)为r处的对数似然比均值；     The function value corresponding to β is initialized to f 1 (β) , and n1 iterations are updated according to the seventh iteration formula on the basis of the f 1 (β) , and the function value of each element is obtained.
    Figure PCTCN2018085645-appb-100022
    Wherein, the seventh iteration calculation formula is
    Figure PCTCN2018085645-appb-100023
    Where f 1 (β) is the log likelihood ratio mean at r;
    将β对应的函数值初始化为f 1 (β)，然后在所述f 1 (β)的基础上按照第八迭代公式进行n4次迭代更新后，得到每个元素的函数值
    Figure PCTCN2018085645-appb-100024
    其中，所述第八迭代计算公式为
    Figure PCTCN2018085645-appb-100025
    f 1 (β)为r处的互信息；     After beta] is initialized to the corresponding function values f 1 (β), and then iteratively updated according to the eighth n4 times on the basis of the iterative equation f 1 (β), based on a function value of each element
    Figure PCTCN2018085645-appb-100024
    Wherein, the eighth iteration calculation formula is
    Figure PCTCN2018085645-appb-100025
    f 1 (β) is mutual information at r;
    其中，1≤m10≤n4，1≤m11≤n4，β1,β2,2β和2β-1均为大于或者等于0且小于或者等于R vb-1的整数。 Wherein, 1≤m10≤n4, 1≤m11≤n4, β1, β2, 2β and 2β-1 are all integers greater than or equal to 0 and less than or equal to R vb -1 .
  18. 根据权利要求4所述的方法，其中，通过所述第二索引矩阵得到所述M_index包括：The method of claim 4, wherein obtaining the M_index by the second index matrix comprises:
    从所述M re中按行或按列或按对角方式选取预定数量的索引，将所述预定数量的索引作为所述M_index。 A predetermined number of indexes are selected from the M re by row or column or diagonally, and the predetermined number of indexes are taken as the M_index.
  19. 根据权利要求18所述的方法，其中，The method of claim 18, wherein
    从所述M re中按列选取预定数量的索引包括：从所述M re中第p列选取K p个索引，其中，
    Figure PCTCN2018085645-appb-100026
    p为整数，且1≤p≤C re；     Selecting a predetermined number of columns from the M re index comprises: selecting from said M re first index column p K p, wherein
    Figure PCTCN2018085645-appb-100026
    p is an integer, and 1 ≤ p ≤ C re ;
    从所述M re中按行选取预定数量的索引包括：从所述M re中第q行选取K q个索引，其中，
    Figure PCTCN2018085645-appb-100027
    q为整数，且1≤q≤R re；     Selecting a predetermined number of rows from said M re index comprises: selecting from said M re q-th row in the q indices K, wherein
    Figure PCTCN2018085645-appb-100027
    q is an integer, and 1 ≤ q ≤ R re ;
    从所述M re中按对角方式选取预定数量的索引包括：从所述M re中 第δ条对角线上选取K δ个索引，其中，
    Figure PCTCN2018085645-appb-100028
    δ为整数，且-min(R re,C re)+1≤δ≤max(R re,C re)-1；其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。     Selecting a predetermined number of indexes from the M re in a diagonal manner includes: selecting K δ indexes from a diagonal line of the δth line in the M re , wherein
    Figure PCTCN2018085645-appb-100028
    δ is an integer, and -min(R re , C re )+1≤δ≤max(R re , C re )-1; wherein min(R re , C re ) represents both R re and C re The minimum value, max(R re , C re ), represents the maximum of both R re and C re .
  20. 根据权利要求18所述的方法，其中，从所述M re中按列选取预定数量的索引包括以下至少之一： The method of claim 18, wherein the selecting a predetermined number of indexes from the M re by a column comprises at least one of the following:
    从所述M re中依次从第1,2，…,C 1列选择K ic1个索引，其中
    Figure PCTCN2018085645-appb-100029
    1≤ic1≤C 1，1≤C 1≤C re，ic1和C 1为整数；     Selecting K ic1 indexes from the first, second, ..., C 1 columns in order from the M re , wherein
    Figure PCTCN2018085645-appb-100029
    1 ≤ ic1 ≤ C 1 , 1 ≤ C 1 ≤ C re , ic1 and C 1 are integers;
    从所述M re中依次从第C 2,C 2+1，…,C 3列选择K ic2个索引，其中
    Figure PCTCN2018085645-appb-100030
    C 2≤ic2≤C 3，1≤C 2≤C 3≤C re，ic2，C 2和C 3为整数；     Selecting K ic2 indexes from the C 2 , C 2 +1, ..., C 3 columns in order from the M re , wherein
    Figure PCTCN2018085645-appb-100030
    C 2 ≤ ic2 ≤ C 3 , 1 ≤ C 2 ≤ C 3 ≤ C re , ic2, C 2 and C 3 are integers;
    从所述M re中依次从第C 4,C 4+1，…,C re列选择K ic3个索引得到的，其中
    Figure PCTCN2018085645-appb-100031
    C 4≤ic3≤C re，1≤C 4≤C re，ic3和C 4为整数。     Selecting K ic3 indexes from the M 4 , C 4 +1, . . . , C re columns in order from the M re , wherein
    Figure PCTCN2018085645-appb-100031
    C 4 ≤ic3≤C re, 1≤C 4 ≤C re, ic3 and C 4 are integers.
  21. 根据权利要求18所述的方法，其中，从所述M re中按行选取预定数量的索引以下至少之一： The method of claim 18, wherein at least one of a predetermined number of indices is selected from the M re by row:
    从所述M re中依次从第1,2，…,R 1行选择K ir1个索引，其中
    Figure PCTCN2018085645-appb-100032
    1≤ir1≤R 1，1≤R 1≤R re，ir1和R 1为整数；     Selecting K ir1 indexes from the first, second, ..., R 1 rows in order from the M re , wherein
    Figure PCTCN2018085645-appb-100032
    1 ≤ ir1 ≤ R 1 , 1 ≤ R 1 ≤ R re , and ir1 and R 1 are integers;
    从所述M re中依次从第R 2,R 2+1，…,R 3行选择K ir2个索引，其中
    Figure PCTCN2018085645-appb-100033
    R 2≤ir2≤R 3，1≤R 2≤R 3≤R re，ir2，R 2和R 3为整数；     Sequentially from R 2, R 2 + 1, ..., R 3 K ir2 row selection index from the M re, where
    Figure PCTCN2018085645-appb-100033
    R 2 ≤ ir2 ≤ R 3 , 1 ≤ R 2 ≤ R 3 ≤ R re , ir2, R 2 and R 3 are integers;
    从所述M re中依次从第R 4,R 4+1，…,R re行选择K ir3个索引，其中
    Figure PCTCN2018085645-appb-100034
    1≤R 4≤R re，ir3和R 4为整数。     Selecting K ir3 indexes from the M re sequentially from the R 4 , R 4 +1, ..., R re rows, wherein
    Figure PCTCN2018085645-appb-100034
    1 ≤ R 4 ≤ R re , and ir3 and R 4 are integers.
  22. 根据权利要求18所述的方法，其中，从所述M re中按对角方式选取预定数量的索引包括以下至少之一： The method of claim 18, wherein the selecting a predetermined number of indexes from the M re in a diagonal manner comprises at least one of the following:
    从所述M re中依次从第-min(R re,C re)+1,-min(R re,C re)+2，…,D 1条对角 线选择K id1个索引，其中
    Figure PCTCN2018085645-appb-100035
    -min(R re,C re)+1≤D 1≤max(R re,C re)-1，id1和D 1为整数；     Selecting K id1 indices from the diagonals of the -min(R re , C re )+1, -min(R re , C re )+2,...,D 1 from the M re , wherein
    Figure PCTCN2018085645-appb-100035
    -min(R re , C re )+1≤D 1 ≤max(R re ,C re )-1, id1 and D 1 are integers;
    从所述M re中依次从第D 2,D 2+1，…,D 3条对角线选择K id2个索引，其中
    Figure PCTCN2018085645-appb-100036
    -min(R re,C re)+1≤D 2≤D 3≤max(R re,C re)-1，id2，D 2和D 3为整数；     Sequentially from the second D 2, D 2 + 1, ..., D 3 K id2 diagonal selected from the index of M re, wherein
    Figure PCTCN2018085645-appb-100036
    -min(R re , C re )+1≤D 2 ≤D 3 ≤max(R re ,C re )-1, id2, D 2 and D 3 are integers;
    从所述M re中依次从第D 4,D 4+1，…,max(R re,C re)-1条对角线选择K id3个索引，其中
    Figure PCTCN2018085645-appb-100037
    -min(R re,C re)+1≤D 4≤max(R re,C re)-1，id3和D 4为整数；     Selecting K id3 indices from the diagonals of D 4 , D 4 +1, . . . , max(R re , C re )-1 from the M re , wherein
    Figure PCTCN2018085645-appb-100037
    -min(R re , C re )+1≤D 4 ≤max(R re ,C re )-1, id3 and D 4 are integers;
    其中，min(R re,C re)表示取R re和C re两者中的最小值，max(R re,C re)表示取R re和C re两者中的最大值。 Where min(R re , C re ) represents the minimum of both R re and C re , and max(R re , C re ) represents the maximum of both R re and C re .
  23. 根据权利要求18或19所述的方法，其中，在从所述M re中按行或按列或按对角方式选取预定数量的索引的过程中，跳过第二比特序列矩阵中未发送比特序列对应的索引，其中，所述第二比特序列矩阵为第一比特序列矩阵进行第二预定变换得到的，所述第一比特序列矩阵为所述极化码编码后比特序列组成，其中，所述第二预定变换包括：行置换或者列置换。 The method according to claim 18 or 19, wherein in the process of selecting a predetermined number of indexes by row or column or diagonally from said M re , skipping untransmitted bits in the second bit sequence matrix An index corresponding to the sequence, wherein the second bit sequence matrix is obtained by performing a second predetermined transform on the first bit sequence matrix, where the first bit sequence matrix is a bit sequence composed of the polarization code encoding, where The second predetermined transform includes: row permutation or column permutation.
  24. 根据权利要求3所述的方法，其中，从所述第二比特序列矩阵中选取所述T个比特作为所述待发送比特序列包括：The method according to claim 3, wherein the selecting the T bits from the second bit sequence matrix as the bit sequence to be transmitted comprises:
    从所述第二比特序列矩阵中按行或按列或按对角方式依次选取所述T个比特作为所述待发送比特序列。The T bits are sequentially selected from the second bit sequence matrix in rows or columns or diagonally as the bit sequence to be transmitted.
  25. 根据权利要求24所述的方法，其中，从所述第二比特序列矩阵中按行或按列或按对角方式依次选取所述T个比特作为所述待发送比特序列包括：The method according to claim 24, wherein sequentially selecting the T bits as the to-be-transmitted bit sequence by row or column or diagonally from the second bit sequence matrix comprises:
    从所述第二比特序列矩阵中的起始位置t开始，按行或按列或按对 角方式从所述第二比特序列矩阵中依次选取所述T个比特，其中，当选取到第二比特序列矩阵中的第一个比特或最后一个比特时，跳到所述第二比特序列矩阵中的最后一个比特或第一个比特继续选取，1≤t≤R vb×C vb。 Starting from a starting position t in the second bit sequence matrix, the T bits are sequentially selected from the second bit sequence matrix in rows or columns or diagonally, wherein when the second bit is selected When the first bit or the last bit in the bit sequence matrix, the last bit or the first bit that jumps to the second bit sequence matrix continues to be selected, 1 ≤ t ≤ R vb × C vb .
  26. 根据权利要求24所述的方法，其中，从所述第二比特序列矩阵中按行或按列或按对角方式依次选取所述T个比特作为所述待发送比特序列包括：The method according to claim 24, wherein sequentially selecting the T bits as the to-be-transmitted bit sequence by row or column or diagonally from the second bit sequence matrix comprises:
    在T小于或者等于所述极化码编码后比特序列的长度N时，按列依次选取所述第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；When T is less than or equal to the length N of the bit sequence after the polarization code encoding, the first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in columns;
    在T小于或者等于所述极化码编码后比特序列的长度N时，按行依次选取所述第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；When T is less than or equal to the length N of the bit sequence after the polarization code encoding, the first to T bits or the N-T+1 to N bits in the second bit sequence matrix are sequentially selected in a row;
    在T小于或者等于所述极化码编码后比特序列的长度N时，按对角方式依次选取所述第二比特序列矩阵中的第1至T个比特或者第N-T+1至N个比特；When T is less than or equal to the length N of the bit sequence after the polarization code encoding, the first to T bits or the N-T+1 to N of the second bit sequence matrix are sequentially selected in a diagonal manner. Bit
    在T大于所述极化码编码后比特序列的长度N时，从所述第二比特序列矩阵中第t个比特开始，按行或按列或按对角方式依次选取T个比特，其中，当选取到所述第二比特序列矩阵中的第一个比特或最后一个比特时，跳到最后一个比特或者第一个比特继续选取，其中，1≤t≤R vb×C vb；其中，N为正整数。 When T is greater than the length N of the bit sequence after the polarization code encoding, starting from the t-th bit in the second bit sequence matrix, T bits are sequentially selected in rows or columns or diagonally, wherein When the first bit or the last bit in the second bit sequence matrix is selected, jumping to the last bit or the first bit continues to be selected, where 1≤t≤R vb ×C vb ; Is a positive integer.
  27. 根据权利要求24所述的方法，其中，从所述第二比特序列矩阵中按列依次选取所述T个比特包括以下至少之一：The method according to claim 24, wherein said T bits are sequentially selected from the second bit sequence matrix in columns, including at least one of the following:
    依次从第1,2，…,E 1列选择T ie1个比特，其中，
    Figure PCTCN2018085645-appb-100038
    1≤ E 1≤C vb，ie1和E 1为整数；     Select T ie1 bits from the first, second, ..., E 1 columns in order, where
    Figure PCTCN2018085645-appb-100038
    1 ≤ E 1 ≤ C vb , ie1 and E 1 are integers;
    依次从第E 2,E 2+1，…,E 3列选择T ie2个比特，其中
    Figure PCTCN2018085645-appb-100039
    1≤E 2≤E 3≤C re，ie2，E 2和E 3为整数；     Select Tie2 bits from the E 2 , E 2 +1, ..., E 3 columns in turn , wherein
    Figure PCTCN2018085645-appb-100039
    1 ≤ E 2 ≤ E 3 ≤ C re , ie2, E 2 and E 3 are integers;
    依次从第E 4,E 4+1，…,E vb列选择T ie3个比特，其中
    Figure PCTCN2018085645-appb-100040
    1≤E 4≤C vb，ie3和E 4为整数。     Select Tie3 bits from the E 4 , E 4 +1, ..., E vb columns in turn , where
    Figure PCTCN2018085645-appb-100040
    1 ≤ E 4 ≤ C vb , ie3 and E 4 are integers.
  28. 根据权利要求24所述的方法，其中，从所述第二比特序列矩阵中按行依次选取所述T个比特包括以下至少之一：The method of claim 24, wherein sequentially selecting the T bits from the second bit sequence matrix in a row comprises at least one of:
    依次从第1,2，…,F 1行选择T if1个比特，其中
    Figure PCTCN2018085645-appb-100041
    1≤F 1≤R vb，if1和F 1为整数；     From the order 1,2, ..., F 1 T if1 row selection bits, wherein
    Figure PCTCN2018085645-appb-100041
    1 ≤ F 1 ≤ R vb , if1 and F 1 are integers;
    依次从第F 2,F 2+1，…,F 3行选择T if2个比特，其中
    Figure PCTCN2018085645-appb-100042
    1≤F 2≤F 3≤R vb，if2，F 2和F 3为整数；     Select T if2 bits from the F 2 , F 2 +1, ..., F 3 lines in turn,
    Figure PCTCN2018085645-appb-100042
    1 ≤ F 2 ≤ F 3 ≤ R vb , if 2 , F 2 and F 3 are integers;
    依次从第F 4,F 4+1，…,R vb行选择T if3个比特，其中
    Figure PCTCN2018085645-appb-100043
    1≤F 4≤R vb，if3和F 4为整数。     Select T if3 bits from the F 4 , F 4 +1, ..., R vb lines in turn, where
    Figure PCTCN2018085645-appb-100043
    1 ≤ F 4 ≤ R vb , if3 and F 4 are integers.
  29. 根据权利要求24所述的方法，其中，从所述第二比特序列矩阵中按对角方式依次选取所述T个比特包括以下至少之一：The method of claim 24, wherein sequentially selecting the T bits from the second bit sequence matrix in a diagonal manner comprises at least one of the following:
    依次从第-min(R vb,C re)+1,-min(R vb,C vb)+2，…,G 1条对角线选择T ig1个比特，其中
    Figure PCTCN2018085645-appb-100044
    -min(R vb,C vb)+1≤G 1≤max(R vb,C vb)-1，ig1和G 1为整数；     Selecting T ig1 bits from the diagonal of the first -min(R vb , C re )+1, -min(R vb , C vb )+2,...,G 1 , in which
    Figure PCTCN2018085645-appb-100044
    -min(R vb , C vb )+1≤G 1 ≤max(R vb , C vb )-1, ig1 and G 1 are integers;
    依次从第G 2,G 2+1，…,G 3条对角线选择K ig2个比特，其中
    Figure PCTCN2018085645-appb-100045
    -min(R vb,C vb)+1≤G 2≤G 3≤max(R vb,C vb)-1，ig2，G 2和G 3为整数；     Sequentially from the G 2, G 2 + 1, ..., G 3 K ig2 diagonal select bits, wherein
    Figure PCTCN2018085645-appb-100045
    -min(R vb , C vb )+1≤G 2 ≤G 3 ≤max(R vb ,C vb )-1, ig2, G 2 and G 3 are integers;
    依次从第G 4,G 4+1，…,max(R vb,C vb)-1条对角线选择K id3个比特， 其中
    Figure PCTCN2018085645-appb-100046
    -min(R vb,C vb)+1≤G 4≤max(R vb,C vb)-1，ig3和G 4为整数。     Select K id3 bits from the diagonals of G 4 , G 4 +1, ..., max(R vb , C vb )-1, respectively.
    Figure PCTCN2018085645-appb-100046
    -min(R vb , C vb )+1≤G 4 ≤max(R vb , C vb )-1, ig3 and G 4 are integers.
  30. 根据权利要求11至29任一项所述的方法，其中，所述M og的列数为32。 The method according to any one of claims 11 to 29, wherein the number of columns of the M og is 32.
  31. 一种序列确定装置，包括：A sequence determining device comprising:
    重排模块，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；a rearrangement module configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence;
    编码模块，配置为对所述第二比特序列进行极化码编码，得到极化码编码后比特序列；An encoding module configured to perform polarization code encoding on the second bit sequence to obtain a bit sequence after encoding the polarization code;
    选取模块，配置为从所述极化码编码后比特序列中选取T个比特作为待发送比特序列；a selection module, configured to select T bits from the bit sequence after the polarization code encoding as a to-be-transmitted bit sequence;
    其中，K和T均为正整数，K≤T。Where K and T are positive integers, K ≤ T.
  32. 根据权利要求31所述的装置，其中，所述装置还包括：第一变换模块，配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过所述第二索引矩阵得到所述M_index；其中，所述第一预定变换包括：行置换或者列置换。The apparatus according to claim 31, wherein the apparatus further comprises: a first transforming module configured to: pass the first index matrix to obtain a second index matrix by using a first predetermined transform; and obtain the M_index; wherein the first predetermined transform comprises: a row permutation or a column permutation.
  33. 根据权利要求31或32所述的装置，其中，所述装置还包括：第二变换模块，配置为将所述极化码编码后比特序列组成第一比特序列矩阵；将所述第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；其中，所述第二预定变换包括：行置换或者列置换；The apparatus according to claim 31 or 32, wherein the apparatus further comprises: a second transform module configured to compose the bit sequence encoded by the polarization code into a first bit sequence matrix; and the first bit sequence Performing a second predetermined transform on the matrix to obtain a second bit sequence matrix; wherein the second predetermined transform comprises: row permutation or column permutation;
    所述选取模块，还配置为从所述第二比特序列矩阵中选取所述T个比特作为所述待发送比特序列。The selecting module is further configured to select the T bits from the second bit sequence matrix as the to-be-transmitted bit sequence.
  34. 一种设备，包括：A device that includes:
    处理器，配置为将长度为K个比特的第一比特序列按照M_index映射到指定位置，得到第二比特序列；将所述第二比特序列进行极化码 编码，得到极化码编码后比特序列；以及从所述极化码编码后比特序列中选取T个比特作为待发送比特序列；其中，K和T均为正整数，K≤T；a processor configured to map a first bit sequence of length K bits to a specified position according to M_index to obtain a second bit sequence; and perform polarization code encoding on the second bit sequence to obtain a bit sequence after encoding the polarization code And selecting T bits from the bit sequence after the polarization code encoding as a bit sequence to be transmitted; wherein, K and T are positive integers, K≤T;
    存储器，与所述处理器耦接。a memory coupled to the processor.
  35. 根据权利要求34所述的设备，其中，所述处理器，还配置为将第一索引矩阵经过第一预定变换得到第二索引矩阵；通过所述第二索引矩阵得到所述M_index；其中，所述第一预定变换包括：行置换或者列置换。The device according to claim 34, wherein the processor is further configured to: pass the first index matrix to obtain a second index matrix by using a first predetermined transform; and obtain the M_index by using the second index matrix; The first predetermined transform includes a row permutation or a column permutation.
  36. 根据权利要求34或35所述的设备，其中，所述处理器，还配置为将所述极化码编码后比特序列组成第一比特序列矩阵；将所述第一比特序列矩阵进行第二预定变换，得到第二比特序列矩阵；以及从所述第二比特序列矩阵中选取所述T个比特作为所述待发送比特序列其中，所述第二预定变换包括：行置换或者列置换。The apparatus according to claim 34 or 35, wherein the processor is further configured to compose the polarization code encoded bit sequence into a first bit sequence matrix; and to perform the first bit sequence matrix on a second predetermined Transforming to obtain a second bit sequence matrix; and selecting the T bits from the second bit sequence matrix as the to-be-transmitted bit sequence, wherein the second predetermined transform comprises: row permutation or column permutation.
  37. 一种存储介质，所述存储介质包括存储的程序，其中，所述程序运行时执行权利要求1至30中任一项所述的方法。A storage medium, the storage medium comprising a stored program, wherein the program is executed to perform the method of any one of claims 1 to 30.
  38. 一种处理器，所述处理器配置为运行程序，其中，所述程序运行时执行权利要求1至30中任一项所述的方法。A processor configured to execute a program, wherein the program is operative to perform the method of any one of claims 1 to 30.
PCT/CN2018/085645 2017-05-05 2018-05-04 Sequence determining method and apparatus, device and storage medium WO2018202142A1 (en)

Priority Applications (10)

Application Number Priority Date Filing Date Title
FIEP18794534.0T FI3570443T3 (en) 2017-05-05 2018-05-04 Polar coding with rate matching
JP2019560749A JP6997214B2 (en) 2017-05-05 2018-05-04 Sequence determination method and device, device, and storage medium
KR1020217013466A KR102382491B1 (en) 2017-05-05 2018-05-04 Method and apparatus for sequence determination, device and storage medium
KR1020197035957A KR102250284B1 (en) 2017-05-05 2018-05-04 Method and apparatus, device and storage medium for sequence determination
AU2018261974A AU2018261974B2 (en) 2017-05-05 2018-05-04 Method and Apparatus for Sequence Determination, Device and Storage Medium
EP18794534.0A EP3570443B1 (en) 2017-05-05 2018-05-04 Polar coding with rate matching
EP24162344.6A EP4380061A3 (en) 2017-05-05 2018-05-04 Sequence determining method and apparatus, device and storage medium
US16/446,605 US10581461B2 (en) 2017-05-05 2019-06-19 Method and apparatus for sequence determination, device and storage medium
US16/807,114 US11271592B2 (en) 2017-05-05 2020-03-02 Method and apparatus for sequence determination, device and storage medium
JP2021203826A JP7332673B2 (en) 2017-05-05 2021-12-16 SEQUENCE DETERMINATION METHOD AND APPARATUS, DEVICE, AND STORAGE MEDIUM

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201710314013 2017-05-05
CN201710314013.X 2017-05-05
CN201710737955.9 2017-08-24
CN201710737955.9A CN108809334B (en) 2017-05-05 2017-08-24 Sequence determination method, device and equipment

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/446,605 Continuation US10581461B2 (en) 2017-05-05 2019-06-19 Method and apparatus for sequence determination, device and storage medium

Publications (1)

Publication Number Publication Date
WO2018202142A1 true WO2018202142A1 (en) 2018-11-08

Family

ID=64016441

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/085645 WO2018202142A1 (en) 2017-05-05 2018-05-04 Sequence determining method and apparatus, device and storage medium

Country Status (1)

Country Link
WO (1) WO2018202142A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113162633A (en) * 2021-02-24 2021-07-23 Oppo广东移动通信有限公司 Decoding method and device of polarization code, decoder, equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684477A (en) * 2012-09-24 2014-03-26 华为技术有限公司 Generation method and generation device for mixed polar code
CN104539393A (en) * 2015-01-07 2015-04-22 北京邮电大学 Source coding method based on polar codes
US20160352464A1 (en) * 2014-02-21 2016-12-01 Huawei Technologies Co., Ltd. Rate matching method and apparatus for polar code
CN106899379A (en) * 2015-12-18 2017-06-27 华为技术有限公司 Method and communication equipment for processing polarization code

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684477A (en) * 2012-09-24 2014-03-26 华为技术有限公司 Generation method and generation device for mixed polar code
US20160352464A1 (en) * 2014-02-21 2016-12-01 Huawei Technologies Co., Ltd. Rate matching method and apparatus for polar code
CN104539393A (en) * 2015-01-07 2015-04-22 北京邮电大学 Source coding method based on polar codes
CN106899379A (en) * 2015-12-18 2017-06-27 华为技术有限公司 Method and communication equipment for processing polarization code

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZTE ET AL.: "Rate Matching of Polar Codes for eMBB", 3GPP TSG RAN WG1 AH_NR MEETING R1-1700249, 20 January 2017 (2017-01-20), XP051207787 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113162633A (en) * 2021-02-24 2021-07-23 Oppo广东移动通信有限公司 Decoding method and device of polarization code, decoder, equipment and storage medium
CN113162633B (en) * 2021-02-24 2023-09-05 Oppo广东移动通信有限公司 Method and device for decoding polarization code, decoder, equipment and storage medium

Similar Documents

Publication Publication Date Title
JP5442024B2 (en) Error correction coding method and apparatus, and communication system using the same
US11095317B2 (en) Efficiently decodable QC-LDPC code
CN101032082B (en) Method and apparatus for encoding and decoding data
JP4672016B2 (en) Encoding and decoding method using low density parity check matrix
US8438459B2 (en) Apparatus and method for decoding using channel code
JP4602406B2 (en) Method and apparatus for encoding and decoding data
KR20090092892A (en) Method of performing decoding using LDPC code
US8996965B2 (en) Error correcting decoding device and error correcting decoding method
JP4917023B2 (en) Error correction coding device
WO2015120719A1 (en) Information processing method and device
JP4672015B2 (en) Encoding and decoding method using low density parity check code
JP2022037127A (en) Sequence determination method and apparatus, device, and storage medium
CN100433561C (en) Method of converting parity check matrix for low density parity check coding
WO2018202142A1 (en) Sequence determining method and apparatus, device and storage medium
US20220224357A1 (en) Data processing method and decoder
Kumar et al. A family of erasure correcting codes with low repair bandwidth and low repair complexity
CN110990188B (en) Construction method of partial repetition code based on Hadamard matrix
WO2018126914A1 (en) Method and device for coding of quasi-cyclic low-density parity-check code, and storage medium
JP5642651B2 (en) Decoding device, encoding / decoding system, encoding / decoding method, and decoding program
CN107317587B (en) Coding and decoding method for low density parity check code
CN116192156A (en) Decoding device, decoding method and electronic device

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18794534

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018794534

Country of ref document: EP

Effective date: 20190816

ENP Entry into the national phase

Ref document number: 2019560749

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20197035957

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2018261974

Country of ref document: AU

Date of ref document: 20180504

Kind code of ref document: A