CN109257140B - Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device - Google Patents

Abstract

The application relates to the technical field of communication, and discloses a polarized channel reliability sequencing method, a polarized code encoding method and a polarized code encoding device, which are used for improving the accuracy of polarized channel reliability sequencing. The method comprises the following steps: determining each of N polarized channelsReliability of the i-th polarized channel, wherein the reliability of the i-th polarized channel is determined based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements inside the first coset, and a constant P related to a physical channel state, i ∈ {1, 2, …, N }, N is a mother code length of a polarized Polar code, and N ═ 2^mM is a positive integer, and the first coset is: the second coset is determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit being 0: a set of encoded codewords determined based on the set 0 th to (i-1) th decoded bit sequences and the ith decoded bit of 1; and determining a reliability sequencing sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.

Description

A method for ranking the reliability of polarized channels, polar code coding method and device

technical field

The embodiments of the present application relate to the field of communications technologies, and in particular, to a method for ranking the reliability of polarized channels, a polar code encoding method, and an apparatus.

Background technique

As the most basic wireless access technology, channel coding plays a crucial role in ensuring the reliable transmission of data. In existing wireless communication systems, Turbo codes, low density parity check codes (low density parity check, LDPC) and polar codes are generally used for channel coding. Turbo codes cannot support information transmission with too low or too high code rates. For the transmission of short and medium packets, Turbo codes and LDPC codes are difficult to achieve ideal performance under the limited code length due to their own coding and decoding characteristics. In terms of implementation, Turbo codes and LDPC codes have high computational complexity in the process of encoding and decoding. Polar code is a good code that can theoretically prove that Shannon capacity can be obtained, and has relatively simple coding and decoding complexity, so it has been more and more widely used.

However, with the rapid evolution of wireless communication systems, future communication systems such as the fifth generation (5th generation, 5G) communication system will have some new features. For example, the three most typical communication scenarios include enhanced mobile broadband (eMBB), massive machine type communication (mMTC), and ultra reliable low latency communication (URLLC). These communication scenarios put forward higher requirements for the encoding and decoding performance of Polar codes.

The reliability ranking of polarized channels plays an important role in the coding and decoding performance of Polar codes. At this stage, the reliability ranking of polarized channels is not very accurate, which affects the coding and decoding performance of Polar codes in the application process. further improvement.

SUMMARY OF THE INVENTION

Embodiments of the present application provide a method for ranking the reliability of polarized channels, a polar code encoding method, and a device, so as to improve the accuracy of ranking the reliability of polarized channels.

The specific technical solutions provided by the embodiments of the present application are as follows:

In a first aspect, a method for ranking the reliability of polarized channels is provided. In this embodiment of the present application, the reliability of polarized channels is determined by using a distance spectrum, and a reliability ranking sequence is obtained, which helps to improve the reliability of polarized channels. The sorting accuracy improves the coding and decoding performance of Polar codes.

In a possible design, the reliability of each polarized channel in the N polarized channels is determined, and the reliability of the N polarized channels is determined according to the reliability of each polarized channel in the N polarized channels Degree sorted sequence. Wherein, the reliability of the ith polarized channel is based on the first distance spectrum between the first coset and the second coset, the second distance spectrum between the elements inside the first coset, and the physical channel state The relevant constant P is determined, i∈{1,2,...,N}, N is the mother code length of the polar code, N=2 ^m , m is a positive integer, the first coset is: based on the setting The 0th to (i-1)th decoded bit sequences of and the coded codeword set determined by the ith decoded bit being 0, the second coset is: based on the set 0th to (( i-1) The sequence of decoded bits and the set of encoded codewords determined by the i-th decoded bit being 1.

或者，

其中，L^(m)(i，P)表示第i个极化信道的可靠度，

为所述第一陪集和第二陪集之间的第一距离谱，

为所述第一陪集内部元素之间的第二距离谱，w为编码码字中包含1的数量，ln为取自然对数运算。In a possible design, the reliability of the ith polarized channel among the N polarized channels is determined according to one of the following formulas:

or,

Among them, L ^(m) (i, P) represents the reliability of the i-th polarized channel,

is the first distance spectrum between the first coset and the second coset,

is the second distance spectrum between the internal elements of the first coset, w is the number of 1s contained in the encoded codeword, and ln is the natural logarithm operation.

所述第一陪集用

表示，

所述第二陪集用

表示，

其中，Span(.)表示由向量生成的线性空间，g_x表示所述Polar码的生成矩阵中的第x行向量，

表示所述第0～第(i-1)个已译码比特序列，|.|为求元素的个数的运算。In one possible design,

The first coset is used

express,

The second coset is used

express,

Among them, Span(.) represents the linear space generated by the vector, g _x represents the x-th row vector in the generator matrix of the Polar code,

represents the 0th to (i-1)th decoded bit sequences, and |.| is an operation for finding the number of elements.

In one possible design, the

In a second aspect, a method for encoding a Polar code is provided, which determines the reliability ranking sequence of N polarized channels; selects an information bit sequence number according to the reliability ranking sequence, and performs coding on the bits to be coded according to the selected information bit sequence number. Polar code encoding. Among them, N is the length of the mother code of the Polar code, N=2 ^m , and m is a positive integer.

In a possible design, when N=512, the reliability ranking sequence is: {0 1 2 4 8 16 32 35 64 6 9 10 128 17 12 18 33 256 20 34 24 65 36 66 7 40 129 11 68 48 13 1314 72 257 21 132 22 80 35 258 25 136 96 260 37 38 264 67 28 41 160 49 69 272 192 15 70 73 74 52 133 81 37 56 82 137259 39 39 97 384 29 84 138 261 145 30 98 43 88 140 262 146 100 265 71 45 161 51148 46 104 266 162 273 75 53 152 112 268 193 164 274 77 54 135 57 83 194 28978 168 276 58 85 60 86 139 99 196 89 290 280 141 176 9 9147 142 31 102263 47 321 292 149 296 92 105 208 267 385 324 304 163 150 55 106 153224 328 269 165 108 275 59 270 167 19569727278178 197897 170 116 177 281 91 91 143 388 293 198 336 172 28230 178294 93 151 323 297 207 280 209 94 204 298 325 184 210 400 305326 110 167 329 157 171 330 226 387 308 216416 337 158 271 118 279 332 389 173 121 199 179 228 338 312 390 174 393 283122 232 340 448 353 394 203 124 295 182 205 63 286 299 354 185 401211 396 344 206 301 95 186 240 327 402 213 356 307 302 111 159 417 331 227404 309 214 119 188 360 418 408 368 217 449 420 310 229 333 218 175 391 123313 230 339 334 220 450 424 314 233 125 287 183 341 395 355 342 234 397 316345 241 207 403 357 187 236 126 303 452 432 242 346 398 215 405 358 361 189456 348 419 406 244 409 362 219 421 369 311 190 410 231 248 364 464 335 422315 221 370 425 451 412 235 222 343 372 426 480 453 317 237 433 347 318 454243 428 399 359 238 376 457 434 349 245 458 407 127 363 350 246 436 465 411460 249 365 466 423 191 371 440 250 413 366 468 481 373 427 414 252 223 374482 429 455 472 377 435 319 239 430 484 459 378 437 488 461 380 438 351 247467 441 251 462 496 442 367 469 470 415 483 253 444 375 473 485 474 431 379486 254 476 489 439 490 381 463 382 497 443 492 498 445 471 446 475 500 487504 255 477 491 478 493 499 494 501 383 447 502 505 506 479 508 495 503 507509 510 511}.

In a possible design, when N=1024, the reliability ranking sequence is: {0 1 2 4 8 16 323 5 64 6 9 10 128 17 12 18 33 256 20 34 24 65 36 66 512 7 40 129 11 68 48 13130 19 14 72 257 21 132 80 35 258 25 136 96 260 37 144 26 514 26467 28 41 160 44 516 69 272 528 15 70 33 74 52133 81320 76 134 27 56 82 137 259 39 97 384 29 84 138 261 145 30 98 515 4388 140 262 146 100 265 71 517 576 518 521 46 104 266163522 6452 112 264 274 529 524529 5244 530 135 57 83 194 289 78168 276 58 85 60 86 139 99 196 89 290 280 545 768 141 176 90 101 147 142 532546 536 31 102 263 47 321 292 200 322 577 149 296 92 105 208 548 578 267 385324 304 163 150 55 106 153 224 386 328 113 519 552 641 79 165 108 154 27559 270 114 166 523 580 560 87 61 156 169 277 278 116 177 281525 642 526 91 62 584 388 33333333333333336 120 178 29493 533 644 534 592 547 770 151 323 392 297 202 107 284 180 209 537 94 204 298352 648 608 325 184 210 400 155 300 1 5 326 115 110 772 549 656 538 550167 212 306 329 157 225 117 171 330 226 387 308 216 416 337 158 776 271 579118 540 553 279 332 389 173 121 199 179 228 338 312 390 174 393 283 122 232340 448 353 394 203 181 672 554 556 561 581 295 285 124 182 205 784 704 63286 527 582 643 585 562 299 354 185 401 211 396 344 206 301 800 95 186 240535 586 564 645 593 327 402 213 356 307 302 832 588 646 111 539 568 594 649771 159 417 331 227 404 309 214 551 609 896 119 188 360 418 408 368 217 449420 541 596 650 773 657 310 229 333 218 542 610 175 391 123 313 230 339 334220 450 424 314 555 600 652 233 774 658 612 125 287 183 341 395 355 777 583557 673 342 234 563 660 558 616 778 674 397 316 345 241 207 403 357 187 236785 126 587 565 664 624 780 303 452 432 242 346 705 398 676 786 589 566 647215 405 358 569 595 361 706 189 456 348 419 801 406 244 409 362 588570 788570 597 219 572 421 369 598 611 708 601 802 311 790 410 653 602231 248 364 464 333 659 654 370 425 41222 222 333 3 43 372426 543 480 614 453 775 317 237 433 559 833 804 712 834 661 808 604 617 720779 347 897 318 454 836 816 675 662 243 428 399 359 238 376 457 434 349 567618 665 736 898 840 781 625 245 458 407 591 677 620 666 787 571 782 626 678127 363 350 246 436 465 411 460 249 365 466 599 707 573 668 681 789 803 790709 682 628 423 689 793 603 574 191 371 440 250 413 366 468 481 373 655 900805 710 427 414 252 615 848 684 794 713 632 690 806 605 223 374 482 663 835904 809 714 619 796 692 429 455 472 377 721 606 716 810 864 837 696 722 912817 435 319 812 239 621 430 484 459 378 667 838 437 488 627 622 461 380 438351 247 679 724 818 841 669 737 629 467 441 251 462 496 442 367 683 842 738899 820 728 928 849 670 783 630 791 844 901 685 469 633 711 470 691 740 850824 902 686 415 483 253 444 375 473 905 795 485 634 744 852 960 865 906 715693 807 474 797 636 694 431 717 575 798 811 866 379 486 697 913 254 723 908856 718 476 813 607 489 752 839 914 868 814 490 623 387 671 929 8433 8433 739 916 821 726 631 700 872 930 920 880 729 443 492 498445 471 961 932 822 741 845 730 446 687 903 635 825 742 851 846 732 962 936826 745 475 500 637 487 504 799 695 853 907 867 854 746 909 828 857 753 719915 869 699 748 638 815 964 944 754 858 910 255 477 491 478 727 917 870 493873 701 968 499 860 494 931 918 756 921 874 731 933 881 823 702 501 922 383743 760 876 976 847 934 827 733 882 937 963 924 747 734 855 884 938 992 447502 505 965 506 829 749 945 859 830 966 755 940 911 871 750 888 479 969 946861 757 970 508 919 639 875 862 758 948 977 923 972 761 877 978 495 935 703883 952 762 503 925 878 980 993 885 939 926 764 735 886 994 941 967 984 507889 947 831 751 942 996 971 890 949 1000 973 892 509 950 863 759 510 979 953763 974 1008 954 879 981 982 927 995 765 956 887 985 997 986 943 891 998 766988 1001 951 1002 893 975 894 1009 955 1004 1010 957 983 958 987 1012 9991016 511 767 989 1003 990 1011 1006 1013 8959 1017 1017 1018 10201007 1019 1021 1022 1023}.

The above sequence helps to improve the accuracy of the polarization channel reliability ranking, and further improves the encoding and decoding performance of the Polar code.

In one possible design, the above sequence is determined by any method as in the first aspect and the possible designs of the first aspect.

In a third aspect, a method for ranking the reliability of polarized channels is provided, and at least one candidate polarized channel reliability ranking sequence is obtained, and each candidate polarized channel reliability ranking sequence is related to the value of the constant P, the The constant P is used to indicate the channel state; according to the target code parameter, a reliability ranking sequence is selected from the at least one candidate reliability ranking sequence as the polarization channel reliability ranking sequence of the Polar code, wherein the target code parameter It includes at least one of the following: the length of the information bits to be encoded, the path width agreed by the encoding side and the decoding side, and the target bit error rate. In this way, the selected reliability ranking sequence can be better adapted to the target application scenario, and better performance of the Polar code can be obtained.

In one possible design, each candidate polarized channel reliability ranking sequence is determined by the reliability of N polarized channels, where the reliability of the ith polarized channel among the N polarized channels is based on the reliability of the ith polarized channel. A first distance spectrum between a coset and a second coset, a second distance spectrum between elements inside the first coset, and the constant P are determined.

Among them, i∈{1, 2,...,N}, N is the mother code length of the polar code, N=2 ^m , m is a positive integer, the first coset is: based on the set 0th to The (i-1)th decoded bit sequence and the coded codeword set determined by the i-th decoded bit being 0, the second coset is: based on the set 0th to (i-1)th A set of encoded codewords determined by a sequence of decoded bits and the i-th decoded bit being 1.

或者，

其中，L^(m)(i，P)表示第i个极化信道的可靠度，

为所述第一陪集和第二陪集之间的第一距离谱，

为所述第一陪集内部元素之间的第二距离谱，w为编码码字中包含1的数量，ln为取自然对数运算。In a possible design, the reliability of the ith polarized channel among the N polarized channels is determined according to one of the following formulas:

or,

Among them, L ^(m) (i, P) represents the reliability of the i-th polarized channel,

is the first distance spectrum between the first coset and the second coset,

is the second distance spectrum between the internal elements of the first coset, w is the number of 1s contained in the encoded codeword, and ln is the natural logarithm operation.

所述第一陪集用

表示，

所述第二陪集用

表示，

其中，Span(.)表示由向量生成的线性空间，g_x表示所述Polar码的生成矩阵中的第x行向量，

表示所述第0～第(i-1)个已译码比特序列，|.|为求元素的个数的运算。In one possible design,

The first coset is used

express,

The second coset is used

express,

Among them, Span(.) represents the linear space generated by the vector, g _x represents the x-th row vector in the generator matrix of the Polar code,

represents the 0th to (i-1)th decoded bit sequences, and |.| is an operation for finding the number of elements.

In one possible design, the

A fourth aspect provides an apparatus for ranking the reliability of polarized channels, the apparatus having the function of implementing the first aspect and any possible method in design of the first aspect. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

In a possible design, when part or all of the functions are implemented by hardware, the apparatus for sorting the reliability of polarized channels includes: a logic circuit configured to execute any one of the first aspect and the first aspect above possible methods.

Optionally, the apparatus for sorting the reliability of polarized channels may be a chip or an integrated circuit.

In a possible design, when part or all of the functions are implemented by software, the device for sorting the reliability of polarized channels includes: a memory for storing a program; a processor for executing a program stored in the memory The program, when the program is executed, the apparatus for ranking the reliability of polarized channels may implement the method described in the first aspect and any possible design of the first aspect.

Optionally, the above-mentioned memory may be a physically independent unit, or may be integrated with the processor.

In a possible design, when part or all of the functions are implemented by software, the means for ranking the reliability of polarized channels includes a processor. The memory for storing the program is located outside the device for sorting the reliability of the polarized channels, and the processor is connected to the memory through a circuit/wire for reading and executing the program stored in the memory.

In a fifth aspect, an encoding device for Polar codes is provided, and the device has the function of implementing any one of the possible methods in the design of the second aspect and the second aspect. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

When part or all of the functions are implemented by hardware, the encoding device includes: an input interface circuit for acquiring bits to be encoded; a logic circuit for implementing any of the second aspect and the second aspect. The method in the design; the output interface circuit is used to output the bit sequence after Polar encoding.

Optionally, the encoding device for the Polar code may be a chip or an integrated circuit.

In a possible design, when part or all of the functions are implemented by software, the polar code encoding device includes: a memory for storing a program; a processor for executing the program stored in the memory , when the program is executed, the encoding device may implement the method described in the second aspect and any possible design of the second aspect.

Optionally, the above-mentioned memory may be a physically independent unit, or may be integrated with the processor.

In a possible design, when part or all of the functions are implemented by software, the encoding device for the Polar code includes a processor. A memory for storing a program is located outside the encoding device, and a processor is connected to the memory through a circuit/wire for reading and executing the program stored in the memory.

In a sixth aspect, an apparatus for ranking reliability of polarized channels is provided, the apparatus having the function of implementing any possible method in design of the third aspect and the third aspect. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

In a possible design, when part or all of the functions are implemented by hardware, the apparatus for sorting the reliability of polarized channels includes: a logic circuit configured to execute any one of the third aspect and the third aspect above possible methods.

Optionally, the apparatus for sorting the reliability of polarized channels may be a chip or an integrated circuit.

In a possible design, when part or all of the functions are implemented by software, the device for sorting the reliability of polarized channels includes: a memory for storing a program; a processor for executing a program stored in the memory The program, when the program is executed, the apparatus for ranking the reliability of polarized channels may implement the method described in the third aspect and any possible design of the third aspect.

Optionally, the above-mentioned memory may be a physically independent unit, or may be integrated with the processor.

In a possible design, when part or all of the functions are implemented by software, the means for ranking the reliability of polarized channels includes a processor. The memory for storing the program is located outside the device for sorting the reliability of the polarized channels, and the processor is connected to the memory through a circuit/wire for reading and executing the program stored in the memory.

In a seventh aspect, a communication system is provided, the system includes a transmitter and a receiver, and the transmitter can execute the method described in any one of the first to third aspects and possible designs thereof.

In an eighth aspect, a computer storage medium is provided, storing a computer program, the computer program comprising a method for executing the method in any possible implementation manner of the first aspect to the third aspect and the first aspect to the third aspect instruction.

In a ninth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods of the above aspects.

Description of drawings

FIG. 1 is a schematic diagram of an architecture of a wireless communication system in an embodiment of the present application;

FIG. 2 is one of the schematic flowcharts of a method for sorting the reliability of polarized channels in an embodiment of the present application;

FIG. 3 is a second schematic flowchart of a method for sorting the reliability of polarized channels in an embodiment of the present application;

4 is a schematic flowchart of a Polar code encoding method in an embodiment of the present application;

FIG. 5 is one of the schematic structural diagrams of an apparatus for sorting the reliability of polarized channels in an embodiment of the present application;

FIG. 6 is a second schematic structural diagram of an apparatus for sorting the reliability of polarized channels according to an embodiment of the present application;

7 is a schematic structural diagram of a Polar code encoding apparatus in an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a device structure for sorting the reliability of polarized channels and a Polar code encoding device in an embodiment of the present application;

FIG. 9 is a third schematic structural diagram of an apparatus for sorting the reliability of polarized channels in an embodiment of the present application;

FIG. 10 is a fourth schematic structural diagram of an apparatus for sorting the reliability of polarized channels according to an embodiment of the present application.

Detailed ways

The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

Embodiments of the present application provide a method and apparatus for ranking the reliability of polarized channels. The higher the reliability of the polarized channel, the higher the decoding accuracy of the decoding side. When the decoding side uses the bit-by-bit decoding method for decoding, the decoding correctness of the currently decoded bit is directly related to the distance spectrum between the encoded codeword sets corresponding to the two sub-paths of the currently decoded bit. The closer the distance spectrum is, the higher the decoding accuracy of the currently decoded bit is, that is, the higher the reliability of the polarized channel. In the embodiment of the present application, the reliability of the polarized channel is determined by using the distance spectrum, and the reliability ranking sequence is obtained, which helps to improve the accuracy of the reliability ranking of the polarized channel and improve the encoding and decoding performance of the Polar code.

In order to facilitate the understanding of the embodiments of the present application, the Polar code is briefly introduced below.

其中

是一个二进制的行矢量，长度为N(即码长)；G_N是一个N×N的矩阵，且

定义为log₂N个矩阵F₂的克罗内克(Kronecker)乘积。上述矩阵

The coding strategy of the Polar code uses the noiseless channel to transmit the useful information of the user, and the full noise channel transmits the agreed information or does not transmit the information. Polar code is also a linear block code, its encoding matrix is G _N , and the encoding process is

in

is a binary row vector with length N (ie code length); G _N is an N×N matrix, and

Defined as the Kronecker product of log ₂ N matrices F ₂ . The above matrix

中的一部分比特用来携带信息，称为信息比特集合，这些比特的索引的集合记作

另外的一部分比特设置为接收端和发送端预先约定的固定值，称之为固定比特集合或冻结比特集合(frozen bits)，其索引的集合用

的补集

表示。Polar码的编码过程相当于：

这里，G_N(A)是G_N中由集合

中的索引对应的那些行得到的子矩阵，G_N(AC)是G_N中由集合

中的索引对应的那些行得到的子矩阵。

为

中的信息比特集合，数量为K；

为

中的固定比特集合，其数量为(N-K)，是已知比特。这些固定比特通常被设置为0，但是只要接收端和发送端预先约定，固定比特可以被任意设置。从而，Polar码的编码输出可简化为：

这里

为

中的信息比特集合，

为长度K的行矢量，即

|·|表示集合中元素的个数，K为信息块大小，

是矩阵G_N中由集合

中的索引对应的那些行得到的子矩阵，

是一个K×N的矩阵。During the encoding process of the Polar code,

A part of the bits is used to carry information, which is called the information bit set, and the index set of these bits is recorded as

The other part of the bits is set to a fixed value pre-agreed by the receiver and the sender, which is called a fixed bit set or a frozen bit set (frozen bits).

complement of

express. The encoding process of the Polar code is equivalent to:

Here, G _N (A) is the set in G _N consisting of

The submatrix obtained by those rows corresponding to the indices in G _N (AC) is the set of G _N in

The resulting submatrix for those rows corresponding to the indices in .

for

The set of information bits in , the number is K;

for

The fixed set of bits in , whose number is (NK), are known bits. These fixed bits are usually set to 0, but the fixed bits can be set arbitrarily as long as the receiving end and the transmitting end agree in advance. Thus, the encoded output of the Polar code can be simplified to:

here

for

The set of information bits in ,

is a row vector of length K, that is

|·| represents the number of elements in the set, K is the size of the information block,

is the set by the matrix G _N

The submatrix obtained by those rows corresponding to the indices in ,

is a K×N matrix.

的选取过程，决定了Polar码的性能。Polar码的构造过程通常是，根据母码码长N确定共存在N个极化信道，分别对应编码矩阵的N个行，计算极化信道可靠度，将可靠度较高的前K个极化信道的索引作为集合

的元素，剩余(N-K)个极化信道对应的索引作为固定比特的索引集合

的元素。集合

决定了信息比特的位置，集合

决定了固定比特的位置。The construction process of Polar code is set

The selection process determines the performance of the Polar code. The construction process of the Polar code is usually as follows: According to the code length N of the mother code, it is determined that N polarized channels coexist, corresponding to the N rows of the coding matrix respectively, the reliability of the polarized channel is calculated, and the top K polarized channels with higher reliability are calculated the index of the channel as a set

, the index corresponding to the remaining (NK) polarized channels is used as the index set of fixed bits

Elements. gather

determines the position of the information bits, the set

Determines the position of the fixed bits.

The solutions provided by the embodiments of the present application relate to how to calculate the reliability of polarized channels. Some terms in this application are explained below for the convenience of those skilled in the art to understand.

1) Background introduction

An effective decoding algorithm for Polar codes is a successive cancellation (successive cancellation, SC) algorithm or a successive cancellation list (successive cancellation list, SCL) algorithm. The SC algorithm is that the value of the current decoded bit can be determined by calculating the transition probability of the channel in which the current decoded bit is 0 or 1 according to the received signal and the decoded bit sequence.

The SCL algorithm is: save multiple bit sequence paths with better metric values, split multiple sub-paths from the stored multiple path bases, sort the metric values of the sub-paths, and select the current decoding from the multiple sub-paths according to the sorting. Preferred path for bits.

The length of the mother code of the Polar code is N, N=2 ^m , and m is a positive integer. There are N polarized channels in the construction parameters of Polar, and the labels of the polarized channels can be from 0 to (N-1) or 1. ~N. In this embodiment of the present application, when determining the i-th polarized channel of the N polarized channels, the value of i may be 1, 2, ..., N. It should be noted that when determining the first polarized channel , the label of the corresponding polarized channel may be the label 0 in the 0-(N-1) labeling method, or may be the label 1 in the 1-N labeling method.

2), the first coset and the second coset

表示，

即序列{u₀、u₁、…、u_i}，

即序列

中的元素为0或1。Given a decoded bit sequence consisting of the 0th to (i-1)th decoded bits, it can also be said that a path is given, assuming that a given path or a given decoded sequence is used

express,

That is, the sequence {u ₀ , u ₁ , ..., u _i },

sequence

The elements in are either 0 or 1.

The first coset can also be called the 0 coset, which is defined as: the first coding code determined based on the set 0th to (i-1)th decoded bit sequence and the ith decoded bit being 0 word collection. Specifically, the decoding result of the i-th decoding bit is unknown. Assuming that the decoding result of the i-th decoding bit is 0, then the (i+1)-th to N-th decoding bits are completely unknown. . The above-mentioned first encoded codeword set can be considered to be composed of two subsets, and the first encoded codeword subset is a sequence consisting of the 0th to (i-1)th decoded sequences and the ith decoding bit being 0. For codewords encoded by the encoding matrix, the second encoded codeword subset is a linear space formed by row vectors corresponding to the (i+1)th to Nth decoding bits in the encoding matrix.

The first coset can be represented by formula (1):

表示第一陪集。Span(.)表示由向量生成的线性空间，g_x表示所述Polar码的生成矩阵中的第x行向量。

represents the first coset. Span(.) represents the linear space generated by the vector, and g _x represents the x-th row vector in the generator matrix of the Polar code.

Similarly, the second coset can also be called a 1 coset, which is defined as: based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit being 1 A collection of two-coded codewords. Specifically, the decoding result of the i-th decoding bit is unknown. Assuming that the decoding result of the i-th decoding bit is 1, then the (i+1)-th to N-th decoding bits are completely unknown. . The above-mentioned second coded codeword set can be considered to be composed of two subsets (the third coded codeword subset and the fourth coded codeword subset), and the third coded codeword subset is the 0th to the (i-1)th The decoded sequence and the i-th decoded bit of 1 are the codewords encoded by the encoding matrix, and the fourth encoded codeword subset is the (i+1)th to Nth decoded bits in the encoding matrix. The linear space formed by the corresponding row vectors in .

The second coset can be expressed by formula (2):

表示第二陪集，Span(.)表示由向量生成的线性空间，g_x表示所述Polar码的生成矩阵中的第x行向量。

represents the second coset, Span(.) represents the linear space generated by the vector, and g _x represents the x-th row vector in the generator matrix of the Polar code.

The first coset and the second coset are two disjoint sets, and the non-overlapping union of the first coset and the second coset is represented by formula (3).

3), distance spectrum

表示，则第一距离谱可以通过公式(4)来确定。The first distance spectrum, that is, the inter-coset distance spectrum between the first coset and the second coset, assuming that the first distance spectrum is

represents, the first distance spectrum can be determined by formula (4).

表示第二陪集

中

序列的元素均为0、且第i个译码比特为1所确定的编码码字集合。

为0向量，表示标号为0～(i-1)的译码比特均为0，公式(4)中d(0，y)＝w部分为对该编码码字集合施加的条件，w为码字的重量(或者行重)，重量即码字中包含的1的个数，w∈{0、1、…、N}，公式中符号|.|用于求符号内集合中元素的个数。公式(4)等号右边的计算可以解释为，基于设定的第0至第(i-1)个已译码比特为0的序列、和第i个译码比特为1所确定的编码码字集合中，码字的重量为w的码字数量。in,

represents the second coset

middle

The set of encoded codewords determined by the elements of the sequence are all 0 and the i-th decoded bit is 1.

is a 0 vector, indicating that the decoded bits labeled 0～(i-1) are all 0, and the part d(0, y)=w in formula (4) is the condition imposed on the encoded codeword set, and w is the code The weight of the word (or line weight), the weight is the number of 1s contained in the codeword, w∈{0, 1, ..., N}, the symbol |.| in the formula is used to find the number of elements in the set within the symbol . The calculation on the right side of the equal sign of formula (4) can be interpreted as the encoding code determined based on the set sequence of the 0th to (i-1)th decoded bits being 0 and the ith decoding bit being 1 In the word set, the weight of the code word is the number of code words of w.

表示，则第二距离谱可以通过公式(5)来确定。The second distance spectrum, that is, the internal distance spectrum of the coset between the internal elements of the first coset, assuming that the second distance spectrum is given by

represents, the second distance spectrum can be determined by formula (5).

表示第一陪集

中

序列的元素均为0、且第i个译码比特也为0所确定的编码码字集合。

为0向量，表示标号为0～i的译码比特均为0。公式(5)中d(0，y)＝w部分为对该编码码字集合施加的条件，w为码字的重量(或者行重)，重量即码字中包含的1的个数，w∈{0、1、…、N}，公式中符号|.|用于求符号内集合中元素的个数。公式(5)等号右边的计算可以解释为，基于设定的第0至第(i-1)个已译码比特为0的序列、且第i个译码比特也为0所确定的编码码字集合中，码字的重量为w的码字数量。in,

represents the first coset

middle

The elements of the sequence are all 0, and the i-th decoded bit is also a set of encoded codewords determined by 0.

is a 0 vector, indicating that the decoded bits labeled 0 to i are all 0. In formula (5), the part d(0, y)=w is the condition imposed on the set of encoded codewords, w is the weight (or row weight) of the codeword, and the weight is the number of 1s contained in the codeword, and w ∈{0, 1, …, N}, the symbol |.| in the formula is used to find the number of elements in the set within the symbol. The calculation on the right side of the equal sign of formula (5) can be interpreted as the code determined based on the set sequence where the 0th to (i-1)th decoded bits are 0, and the ith decoded bit is also 0 In the codeword set, the weight of the codeword is the number of codewords of w.

The definitions of the same letters or symbols in the embodiments of the present application and the meanings they represent should be the same, and repeated descriptions will not be repeated. It can be understood that the formula involved in the embodiment of the present application is only an example, and those skilled in the art can obtain the solution on the basis of simple deformation of the formula without affecting the performance of the formula, all belong to the protection of the embodiment of the present application. range.

As shown in FIG. 1 , the communication system 100 applied in the embodiment of the present application includes a sending end 101 and a receiving end 102 . The sending end 101 may also be called an encoding end, and the receiving end 102 may also be called a decoding end. The transmitting end 101 may be a base station, and the receiving end 102 may be a terminal; or, the transmitting end 101 may be a terminal, and the receiving end 102 may be a base station. A base station is a device deployed in a radio access network to provide a terminal with a wireless communication function. The base station may include various forms of macro base station, micro base station, relay station, access point and so on. It can be applied in systems of different radio access technologies, such as long term evolution (long term evolution, LTE) systems, or more possible communication systems such as fifth generation (5th generation, 5G) communication systems. The base station may also be other network devices having the function of the base station, in particular, may also be a terminal serving as the function of the base station in the D2D communication. Terminals may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices, or other processing devices connected to wireless modems with wireless communication capabilities, as well as various forms of user equipment (UE), mobile stations (mobile stations) , MS) etc.

Based on the communication system architecture shown in FIG. 1 , in this embodiment of the present application, the execution subject of the method for performing the reliability ranking of polarized channels may be the sender 101 . The method for sorting the reliability of polarized channels provided by the embodiments of the present application will be described in detail below.

Based on the above background introduction and terminology description and the communication system architecture shown in FIG. 1 , as shown in FIG. 2 , the specific process of the method for ranking the reliability of polarized channels provided by the embodiment of the present application is as follows.

Step 201: Determine the reliability of each polarized channel in the N polarized channels.

Wherein, the reliability of the ith polarized channel is based on the first distance spectrum between the first coset and the second coset, the second distance spectrum between the elements inside the first coset, and the physical channel state-related The constant P is determined, i∈{1, 2, . The first coset is: the set of encoded codewords determined based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit is 0, and the second coset is: based on the set A set of encoded codewords determined by the 0th to (i-1)th decoded bit sequences and the i-th decoded bit being 1.

Step 202: Determine the reliability ranking sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.

After determining the reliability ranking sequence of the N polarized channels, select the information bit sequence number according to the reliability ranking sequence, and perform polar code encoding on the bits to be coded according to the selected information bit sequence number. The specific encoding process is as described above for the Polar code 's introduction.

Specifically, the reliability of the i-th polarized channel among the N polarized channels may be determined according to formula (6) or formula (7).

为第一陪集和第二陪集之间的第一距离谱，

为第一陪集内部元素之间的第二距离谱，w为编码码字中包含1的数量，ln为取自然对数运算。Among them, L ^(m) (i, P) represents the reliability of the i-th polarized channel,

is the first distance spectrum between the first coset and the second coset,

is the second distance spectrum between the internal elements of the first coset, w is the number of 1s contained in the encoded codeword, and ln is the natural logarithm operation.

当信噪比高时，信道处于较好状态，P的值应该是较低的；当信噪比比较低时，信道处于较差状态，P的值应该是比较高的，例如P值可以取

P is some approximate value of the physical channel state, which has a certain value range. For example, the value range of P is

When the signal-to-noise ratio is high, the channel is in a good state, and the value of P should be low; when the signal-to-noise ratio is relatively low, the channel is in a poor state, and the value of P should be relatively high. For example, the value of P can be taken as

Since P takes different values, the reliability ranking sequences determined by applying the above method for reliability ranking of polarized channels are different. Within the value range of P, a set of reliability ranking sequences can be obtained. Based on this, on the basis of the method shown in FIG. 2 , as shown in FIG. 3 , the embodiment of the present application further provides another method for ranking the reliability of polarized channels. Specifically:

Step 301: Obtain at least one candidate polarization channel reliability ranking sequence.

Optionally, each candidate polarization channel reliability ranking sequence is related to the value of the constant P, and the constant P is used to indicate the physical channel state. Specifically, each candidate polarization channel reliability ranking sequence can adopt the above steps. Determined by S201 and S202, the values of the constant P corresponding to different candidate polarization channel reliability rankings are different. For the convenience of description, how to determine each candidate polarization channel reliability ranking sequence is not repeated here.

Step 302: Select a reliability ranking sequence from the at least one candidate reliability ranking sequence as the target polarization channel reliability ranking sequence.

Optionally, a reliability ranking sequence may be selected from the at least one candidate reliability ranking sequence as the target polarization channel reliability ranking sequence according to the target parameter, wherein the target code parameter includes at least one of the following: the information to be encoded. Bit length, path width and target bit error rate agreed between the encoding side and the decoding side.

Specifically, according to the target code parameters, perform performance simulation on the candidate polarization channel reliability ranking sequences to obtain the performance of each candidate ranking sequence. According to the rules for judging the quality of performance, the quality of the performance of each candidate sorting sequence is determined, which is further used for the reliability sorting sequence used by the Polar code encoding.

It should be noted that, since the related prior art has already disclosed how to select a reliability ranking sequence from the above at least one candidate reliability ranking sequence as the target polarization channel reliability ranking sequence according to the target parameter, this application does not address this. Repeat.

After determining the target polarization channel reliability ranking sequence, select the information bit sequence number according to the target polarization channel reliability ranking sequence, and perform Polar code encoding on the bits to be encoded according to the selected information bit sequence number.

To sum up, the reliability ranking sequence generated according to the distance spectrum in the embodiment of the present application can more accurately reflect the reliability ranking of polarized channels, which is helpful to improve the coding and decoding performance of Polar codes.

Based on the communication system architecture shown in FIG. 1 , an embodiment of the present application further provides a Polar code encoding method. As shown in FIG. 4 , the specific process of the Polar code encoding method is as follows.

Step 401: Determine the reliability ranking sequence of the N polarized channels.

Among them, N is the length of the mother code of the Polar code, N=2 ^m , and m is a positive integer;

Step 402: According to the reliability sorting sequence, select an information bit sequence number, and perform Polar code encoding on the bits to be coded according to the selected information bit sequence number.

The embodiments of the present application provide the following examples of some optional reliability ranking sequences. In the process of Polar coding, the reliability ranking sequence can be obtained by the method shown in Figure 2 or Figure 3; the obtained reliability ranking sequence can also be stored in advance, and the stored reliability ranking sequence can be applied, for example, using a look-up table way to obtain. The following reliability ranking sequence may be obtained by using the method shown in FIG. 2 or FIG. 3 in the embodiment of the present application, or may be obtained by other possible methods, which are not limited in the embodiment of the present application.

Example 1.

When N=512, the reliability ranking sequence can be:

{0 1 2 4 8 16 32 3 5 64 6 9 10 128 33 256 20 34 66666666 48 48 13 13 14 72 257 21 132 80 35 136 96 260 37144 26 38 38 264 67 28 41 160 42 44 49 69 272 192 15 70 131 73 50 288 23 74 52133 81 320 76 134 27 56 82 137 259 39 97 384 29 84 138 261 145 30 98 43 88140 262 146 100 265 71 45 161 51 148 46 104 266 162 273 75 53 152 112 268 193164 274 77 54 135 57 83 194 289 78 168 276 58 85 60 86 139 99 196 89 290 280141 176 90 101 147 142 31 102 263 47 321 292 200 322 149 296 92 105 208 267385 324 304 163 150 55 106 153 224 386 328 269 113 79 165 108 275 59 270114 166 87 61 156 169 277 278 170 116 177 281 62 143 383198 336 178 294 93 15132320 392 297 202 107 284 180 209 94204 298 352 325 184 210 400 300 109 155 326 115 110 167 212 306 3225 117 171 333838 416 337 158 279 389179 3333338 31838338338 318338338338338338338 318338 318338338383838383383383838383838338338338338338 318333838383833383383383338 3128 3128 3128 3128 31833383383338338333833833383383383383338 312 283 122 232 340 448 353 394 203 181 295 285 124182 205 63 286 299 354 185 4 01 211 396 344 206 301 95 186 240 327 402 213 356307 302 111 159 417 331 227 404 309 214 119 188 360 418 408 368 217 449 420310 229 333 218 175 391 123 313 230 339 334 220 450 424 314 233 125 287 183341 395 355 342 234 397 316 345 241 207 403 357 187 236 126 303 452 432 242346 398 215 405 358 361 189 456 348 419 406 244 409 362 219 421 369 311 190410 231 248 364 464 335 422 315 221 370 425 451 412 235 222 343 372 426 480453 317 237 433 347 318 454 243 428 399 359 238 376 457 434 349 245 458 407127 363 350 246 436 465 411 460 249 365 466 423 191 371 440 250 413 366 468481 373 427 414 252 223 374 482 429 455 472 377 435 319 239 430 484 459 378437 488 461 380 438 351 247 467 441 251 462 496 442 367 469 470 415 483 253444 375 473 485 474 431 379 486 254 476 489 439 490 381 463 382 497 443 492498 445 471 446 475 500 487 504 255 477 491 478 493 499 494 501 383 447 502505 506 479 508 495 503 507 509 510 511}.

Example two,

When N=1024, the reliability ranking sequence can be:

{0 1 2 4 8 16 32 3 5 64 6 9 10 128 33 256 20 34 666512 7 40 129 11 68 13 13 14 72 257 21 132 80 35 136 96 26037 144 26 26 513 38 514 264 67 28 41 160 42 44 516 49 69 272 192 520 528 15 70131 73 50 288 544 23 74 52 133 81 320 76 134 27 56 82 137 259 39 97 384 29 84138 261 145 30 98 515 43 88 140 262 146 100 265 71 45 161 576 518 5118 51 148521 46 104 266 162 273 522 640 75 53 152 112 264 274 77 529 524530 57 83 194 289 276 58 86 1399990 545 768141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414141414 176 90 101 147 142 532 546 536 31 102 263 47 321 292 200 322 577 149 29692 105 208 548 578 267 385 324 304 163 150 55 106 153 224 386 328 269 113 519552 641 79 165 108 154 275 59 270 114 166 523 580 560 87 195 61 156 169 277291 278 197 170 116 177 281 525 642 531 526 91 62 584 769 143 388 293 198 103336 172 282 201 120 178 294 93 533 644 534 592 547 770 151 323 392 297 202107 284 180 209 537 94 204 298 352 648 608 325 184 210 400 305 300 109 155326 115 110 772 549 656 538 550 167 212 306 329 157 225 117 171 330 226 387308 216 416 337 158 776 271 579 118 540 553 279 332 389 173 121 199 179 228338 312 390 174 393 283 122 232 340 448 353 394 203 181 672 554 556 561 581295 285 124 182 205 784 704 63 286 527 582 643 585 562 299 354 185 401 211396 344 206 301 800 95 186 240 535 586 564 645 593 327 402 213 356 307 302832 588 646 111 539 568 594 649 771 159 417 331 227 404 309 214 551 609 896119 188 360 418 408 368 217 449 420 541 596 650 773 657 310 229 333 218 542610 175 391 123 313 230 339 334 220 450 424 314 555 600 652 233 774 658 612125 287 183 341 395 355 777 583 557 673 342 234 563 660 558 616 778 674 397316 345 241 207 403 357 187 236 785 126 587 565 664 624 780 303 452 432 242346 705 398 676 786 589 566 647 215 405 358 569 595 361 706 189 456 348 419801 406 244 409 362 590 680 788 570 597 219 572 421 369 598 651 611 708 601802 311 792 190 410 653 688 602 231 248 364 464 335 422 613 659 654 315 221370 425 451 412 235 222 343 372 426 543 480 614 453 775 317 237 433 559 833804 712 834 661 808 604 617 720 779 347 897 318 454 836 816 675 662 243 428399 359 238 376 457 434 349 567 618 665 736 898 840 781 625 245 458 407 591677 620 666 787 571 782 626 678 127 363 350 246 436 465 411 460 249 365 466599 707 573 668 681 789 803 790 709 682 628 423 689 793 603 574 191 371 440250 413 366 468 481 373 655 900 805 710 427 414 252 615 848 684 794 713 632690 806 605 223 374 482 663 835 904 809 714 619 796 692 429 455 472 377 721606 716 810 864 837 696 722 912 817 435 319 812 239 621 430 484 459 378 667838 437 488 627 622 461 380 438 351 247 679 724 818 841 669 737 629 467 441251 462 496 442 367 683 842 738 899 820 728 928 849 670 783 630 791 844 901685 469 633 711 470 691 740 850 824 902 686 415 483 253 444 375 473 905 795485 634 744 852 960 865 906 715 693 807 474 797 636 694 431 717 575 798 811866 379 486 697 913 254 723 908 856 718 476 813 607 489 698 752 839 914 725868 814 490 623 387 671 929 821 726 631 700872 9 9 30 920 880 729 443 492 498 445 471 961 932 822 741 845 730 446 687 903635 825 742 851 846 732 962 936 826 745 475 500 637 487 504 799 695 853 907867 854 746 909 828 857 753 719 915 869 699 748 638 815 964 944 754 858 910255 477 491 478 727 917 870 493 873 701 968 499 860 494 931 918 756 921 874731 933 881 823 702 501 922 383 743 760 876 976 847 934 827 733 882 937 963924 747 734 855 884 938 992 447 502 505 965 506 829 749 945 859 830 966 755940 911 871 750 888 479 969 946 861 757 970 508 919 639 875 862 758 948 977923 972 761 877 978 495 935 703 883 952 762 503 925 878 980 993 885 939 926764 735 886 994 941 967 984 507 889 947 831 751 942 996 971 890 949 1000 973892 509 950 863 759 510 979 953 763 974 1008 954 879 981 982 927 995 765 956887 985 997 986 943 891 998 766 988 1001 951 1002 893 975 894 1009 955 10041010 957 983 958 987 1012 999 1016 511 767 989 1003 990 1005 1011 1006 1013895 959 1014 1017 1018 991 1020 1007 1015 1019 1021 1022 1023}.

Example three,

When N=64, the reliability ranking sequence can be:

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

Example 4.

When N=128, the reliability ranking sequence can be:

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

Example 5.

When N=256, the reliability ranking sequence can be:

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

Example 6.

When N=512, the reliability ranking sequence can be:

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

It should be noted that some of the above-mentioned reliability ranking sequences are just examples, and their application to the Polar coding process will help to improve the Poalr coding performance. In any example of the reliability ranking sequence, on the premise of not affecting its overall effect, adjustments including but not limited to the following aspects or equivalent replacements can be made:

1. The positions of the few elements in the reliability sorted sequence are exchanged. For example, the position of the serial number can be adjusted within the set range. For example, if the set range is 5, the position of the element with the serial number of 10 can be adjusted within 5 positions on the left and right;

2. The reliability sorting sequence includes N elements starting from 0 and ending at N-1, where N is the code length of the mother code, and the N elements starting from 0 and ending at N-1 represent the sequence numbers of N polarized channels. Actually, the sequence numbers of the N polarized channels can also start from 1 and end at N. Of course, the sequence numbers or identifiers of the polarized channels may also be represented in other ways, and the specific representations do not affect the specific positions of the polarized channels represented in the sequence.

3. The elements in the above reliability sorting sequence can be reversed.

Based on the method for sorting the reliability of polarized channels shown in FIG. 2 , as shown in FIG. 5 , an embodiment of the present application further provides an apparatus 500 for sorting the reliability of polarized channels. The apparatus 500 for sorting the reliability of polarized channels uses For performing the method for ranking the reliability of polarized channels shown in FIG. 2, the apparatus 500 for ranking the reliability of polarized channels includes:

Determining unit 501, configured to determine the reliability of each polarized channel in the N polarized channels, wherein the reliability of the i-th polarized channel is based on the first distance spectrum between the first coset and the second coset , the second distance spectrum between the internal elements of the first coset, and the constant P related to the physical channel state, i∈{1, 2,...,N}, N is the mother code length of the polar code, N =2 ^m , m is a positive integer, and the first coset is: the set of encoded codewords determined based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit being 0 , the second coset is: a set of encoded codewords determined based on the 0th to (i-1)th decoded bit sequences set and the ith decoded bit being 1;

The sorting unit 502 is configured to determine the reliability sorting sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels.

Based on the method for sorting the reliability of polarized channels shown in FIG. 3 , as shown in FIG. 6 , an embodiment of the present application further provides an apparatus 600 for sorting the reliability of polarized channels. The apparatus 600 for sorting the reliability of polarized channels uses For performing the method for ranking the reliability of polarized channels shown in FIG. 3 , the apparatus 600 for ranking the reliability of polarized channels includes:

The determining unit 601 is configured to obtain at least one candidate polarization channel reliability ranking sequence.

Optionally, each candidate polarization channel reliability ranking sequence is related to the value of the constant P, and the constant P is used to indicate the physical channel state;

The selecting unit 602 is configured to select a reliability ranking sequence from the at least one candidate reliability ranking sequence as the polarization channel reliability ranking sequence of the Polar code according to the target code parameter.

The target code parameters include at least one of the following: the length of the information bits to be encoded, the path width agreed between the encoding side and the decoding side, and the target bit error rate.

Based on the Polar code encoding method shown in FIG. 4 , as shown in FIG. 7 , an embodiment of the present application further provides a Polar code encoding apparatus 700 , and the Polar code encoding apparatus 700 is configured to execute the Polar code shown in FIG. 4 . The encoding method, the encoding device 700 of the Polar code includes:

A determination unit 701, configured to determine the reliability ranking sequence of N polarized channels, where N is the length of the mother code of the Polar code, N=2 ^m , and m is a positive integer;

The encoding unit 702 is configured to sort the sequence according to the reliability, select an information bit sequence number, and perform Polar code encoding on the bits to be encoded according to the selected information bit sequence number.

Based on the same inventive concept of the method for sorting the reliability of polarized channels shown in FIG. 2 , as shown in FIG. 8 , an embodiment of the present application further provides a reliability sorting apparatus 800 for polarized channels. The reliability sorting apparatus 800 A reliability ranking method for performing the polarization channel shown in FIG. 2 . Part or all of the method in the above-mentioned embodiment of FIG. 2 may be implemented by hardware or by software. When implemented by hardware, the reliability sorting apparatus 800 may include a logic circuit, and the logic circuit is used to execute the method. The reliability sorting apparatus 800 can be applied to a Polar code encoding apparatus 900. The Polar code encoding apparatus 900 may include: an input interface circuit 901 for acquiring bits to be encoded; the reliability sorting apparatus 800 for performing the above For the method in the embodiment of FIG. 2 , please refer to the description in the previous method embodiment for details, which will not be repeated here; the output interface circuit 902 is used to output the Polar-encoded bit sequence.

Optionally, the reliability sorting apparatus 800 may be a chip or an integrated circuit during specific implementation.

Optionally, when part or all of the method in the embodiment of FIG. 2 is implemented by software, as shown in FIG. 9 or FIG. 10 , the reliability sorting apparatus 800 includes: a memory 1001 for storing a program; a processor 1002, It is used to execute the program stored in the memory 1001. When the program is executed, the reliability sorting apparatus 800 can implement the method provided by the above embodiment in FIG. 2 .

Optionally, the above-mentioned memory 1001 may be a physically independent unit as shown in FIG. 9 , or may be integrated as shown in FIG. 10 .

Optionally, when part or all of the method in the above-mentioned embodiment of FIG. 2 is implemented by software, the reliability sorting apparatus 800 may only include the processor 1002 . The memory 1001 for storing programs is located outside the reliability sorting device 800 , and the processor 1002 is connected to the memory 1001 through circuits/wires for reading and executing the programs stored in the memory 1001 .

An embodiment of the present application provides a computer storage medium storing a computer program, where the computer program includes a method for executing the method shown in any of the embodiments in FIG. 2 to FIG. 4 .

Embodiments of the present application provide a computer program product containing instructions, which, when executed on a computer, cause the computer to execute the method shown in any of the embodiments in FIG. 2 to FIG. 4 .

As will be appreciated by those skilled in the art, the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

Although the preferred embodiments of the present application have been described, additional changes and modifications to these embodiments may occur to those skilled in the art once the basic inventive concepts are known. Therefore, the appended claims are intended to be construed to include the preferred embodiment and all changes and modifications that fall within the scope of this application.

Obviously, those skilled in the art can make various changes and modifications to the embodiments of the present application without departing from the spirit and scope of the embodiments of the present application. Thus, if these modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims (10)

1. A method for sorting the reliability of polarized channels, comprising: Determine the reliability of each of the N polarized channels, wherein the reliability of the ith polarized channel is based on the first distance spectrum between the first coset and the second coset, the first coset The second distance spectrum between elements in the set and the constant P related to the physical channel state are determined, i∈{1,2,...,N}, N is the mother code length of the polar code, N=2 ^m , m is a positive integer, and the first coset is: a set of encoded codewords determined based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit being 0, so Described second coset is: based on the set 0th to (i-1) th decoded bit sequence and the ith decoded bit is 1 The determined coded codeword set; The reliability ranking sequence of the N polarized channels is determined according to the reliability of each of the N polarized channels. 2. The method of claim 1, wherein the reliability of the i-th polarized channel in the N polarized channels is determined according to one of the following formulas:

or,

Among them, L ^(m) (i, P) represents the reliability of the i-th polarized channel,

is the first distance spectrum between the first coset and the second coset,

is the second distance spectrum between the internal elements of the first coset, w is the number of 1s contained in the encoded codeword, and ln is the natural logarithm operation. 3. The method of claim 2, wherein

The first coset is used

express,

The second coset is used

express,

Among them, Span(.) represents the linear space generated by the vector, g _x represents the x-th row vector in the generator matrix of the Polar code,

represents the 0th to (i-1)th decoded bit sequences, and |.| is an operation for finding the number of elements. 4. The method of claim 2 or 3, wherein the

5. A device for sorting the reliability of polarized channels, comprising: a determining unit, configured to determine the reliability of each polarized channel in the N polarized channels, wherein the reliability of the i-th polarized channel is based on the first distance spectrum between the first coset and the second coset, The second distance spectrum between the internal elements of the first coset and the constant P related to the physical channel state are determined, i∈{1,2,...,N}, N is the mother code length of the polar code, N=2 ^m , m is a positive integer, and the first coset is: the code determined based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit being 0 A codeword set, the second coset is: an encoded codeword set determined based on the set 0th to (i-1)th decoded bit sequences and the ith decoded bit being 1; A sorting unit, configured to determine the reliability sorting sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels. 6. The apparatus according to claim 5, wherein the determining unit determines the reliability of the i-th polarized channel in the N polarized channels according to one of the following formulas:

or,

Among them, L ^(m) (i, P) represents the reliability of the i-th polarized channel,

is the first distance spectrum between the first coset and the second coset,

is the second distance spectrum between the internal elements of the first coset, w is the number of 1s contained in the encoded codeword, and ln is the natural logarithm operation. 7. The apparatus of claim 6, wherein

The first coset is used

express,

The second coset is used

express,

Among them, Span(.) represents the linear space generated by the vector, g _x represents the x-th row vector in the generator matrix of the Polar code,

represents the 0th to (i-1)th decoded bit sequences, and |.| is an operation for finding the number of elements. 8. The device of claim 6 or 7, wherein the

9. A device for sorting the reliability of polarized channels, comprising: memory for storing programs; a processor for executing the program stored in the memory, when the program is executed, the processor is configured to: Determine the reliability of each polarized channel in the N polarized channels, and determine the reliability ranking sequence of the N polarized channels according to the reliability of each polarized channel in the N polarized channels; The reliability of the i polarized channels is based on a first distance spectrum between a first coset and a second coset, a second distance spectrum between elements within the first coset, and a constant related to the physical channel state P is determined, i∈{1,2,...,N}, N is the mother code length of the polar code, N=2 ^m , m is a positive integer, the first coset is: based on the set to the (i-1)th decoded bit sequence and the set of encoded codewords determined by the i-th decoded bit being 0, the second coset is: based on the set 0th to (i-1th ) sequence of decoded bits and the set of encoded codewords determined by the i-th decoded bit being 1. 10 . The device of claim 9 , wherein the device for ranking the reliability of polarized channels is a chip or an integrated circuit. 11 .

Images