A communication method and apparatus

Abstract

A communication method and device are used to construct a reliability sequence with a length greater than 1024, and ensure the communication reliability based on the polarization coding of the reliability sequence. The method comprises: a first device obtaining an information bit sequence; the first device performing polarization coding on the information bit sequence according to a first sequence with a length of N to obtain a polarization coded bit sequence, wherein the first sequence comprises N bit indexes, the bit indexes in the first sequence are sorted according to the reliability of the bit indexes, a qth bit index in M bit indexes in the N bit indexes is equal to a sum of a qth bit index in a second sequence with a length of M and k1*M, q=0, 1, 2,..., M-1, k1 is an integer greater than or equal to 0, and N is 2048, 4096 or 8192; and outputting the polarization coded bit sequence.

Description

Technical Field

[0001] This application relates to the field of mobile communication technology, and in particular to a communication method and apparatus. Background Technology

[0002] Polar codes are the first coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity. They have the advantages of good decoding performance and low complexity. They have been selected by the 3rd Generation Partnership Project (3GPP) as the control channel coding scheme for enhanced mobile broadband (eMBB) scenarios.

[0003] Currently, the maximum length of reliability sequences supported by 5G new radio (NR) systems is 1024. How to construct longer reliability sequences is a technical problem that urgently needs to be solved. Summary of the Invention

[0004] This application provides a communication method and apparatus for constructing a reliability sequence with a length greater than 1024 and ensuring good communication performance.

[0005] Firstly, embodiments of this application provide a communication method, which can be executed by a first device or a first equipment, or in other words, the method can be applied to a first device or a first equipment. Unless otherwise specified, the "first device" in this application can refer to the first equipment itself (e.g., a terminal, terminal device, or network device), a component used in the first device (e.g., a functional module, communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first device. The component used in the first device can be within the first device or independent of it. The first device can be a transmitting device, and correspondingly, the receiving device is a second device. Taking the first device as the executing entity as an example, the method includes:

[0006] The first device acquires an information bit sequence; the first device performs polar coding on the information bit sequence according to a first sequence of length N to obtain a polar-coded bit sequence, wherein the first sequence includes N bit indices, the bit indices in the first sequence are sorted according to the reliability of the bit indices, the q-th bit in the M first bit indices of the N bit indices is equal to the sum of the q-th bit in the second sequence of length M and k1*M, q = 0, 1, 2...M-1, k1 is an integer greater than or equal to 0, and N is 2048, 4096 or 8192; the polar-coded bit sequence is output. Alternatively, the q-th bit in the M first bit indices is equal to the q-th bit in the second sequence of length M, or the q-th bit in the M first bit indices is equal to the sum of the q-th bit in the second sequence of length M and a positive integer multiple of M. It can also be said that the M first bit indices of the N bit indices of the first sequence are related to the second sequence. Where M is a positive integer, and M is less than N.

[0007] Based on the method described in the first aspect, the first device can construct a first sequence with a length greater than 1024 and perform polar coding based on the first sequence, thereby realizing polar coding based on a reliability sequence with a length greater than 1024, which is applicable to scenarios requiring polar coding of a reliability sequence with a length greater than 1024. For example, the first sequence is a reliability sequence with a length of 2048, 4098, or 8192. The first sequence or a portion thereof may be related to the second sequence, ensuring good communication performance.

[0008] In this application, the bit sequence number corresponds to a sub-channel, and the sub-channel is used to carry the corresponding bit. For example, each bit sequence number can be used as the sequence number of a sub-channel. Alternatively, the bit sequence number can be replaced with the sub-channel sequence number.

[0009] Secondly, embodiments of this application provide a communication method, which can be executed by a second device or a second apparatus, or in other words, the method can be applied to a second device or a second apparatus. Unless otherwise specified, the "second device" in this application can refer to the second apparatus itself, a component within the second apparatus, or a logic module or software capable of implementing all or part of the second apparatus. The second apparatus can be a receiving device and / or a decoding device. Specifically, the second apparatus can be a terminal or a network device such as a base station. The components in this application may include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, a transceiver unit, or other functional modules. Taking the execution subject as an example, the method includes:

[0010] The second device acquires a sequence of symbols to be decoded; the second device performs polar decoding on the sequence of symbols to be decoded according to a first sequence of length N, to obtain a polar-decoded bit sequence, wherein the first sequence includes N bit indices, the bit indices in the first sequence are ordered according to the reliability of the bit indices, the q-th bit in the M first bit indices of the N bit indices is equal to the sum of the q-th bit in the second sequence of length M and k1*M, q = 0, 1, 2...M-1, k1 is an integer greater than or equal to 0, and N is 2048, 4096 or 8192. Where M is a positive integer and M is less than N. Alternatively, the q-th bit in the M first bit indices is equal to the q-th bit in the second sequence of length M, or the q-th bit in the M first bit indices is equal to the sum of the q-th bit in the second sequence of length M and a positive integer multiple of M. Alternatively, it can be said that M of the first bits in the N bits of the first sequence are related to the second sequence. Here, M is a positive integer, and M is less than N.

[0011] The beneficial effects in the second aspect can be found in the description of the beneficial effects in the first aspect, and will not be repeated here.

[0012] In one possible implementation of the first or second aspect, the N bit indices include bit indices in p number groups of length M, wherein p1 number groups in the p number groups of length M satisfy the following: the q-th bit in the number group is equal to the q-th bit in the second sequence, or the q-th bit in the number group is equal to the sum of the q-th bit in the second sequence and a positive integer multiple of M, where p is a positive integer greater than 1, and p1 is a positive integer greater than 1 and less than or equal to p; wherein p1 / p is greater than or equal to a first threshold. At least one of the p1 number groups includes M first bit indices.

[0013] Based on this implementation, the proportion of sequence number groups related to the second sequence is relatively large. When the second sequence is a primary type sequence, good decoding performance can be guaranteed. For example, the first threshold can be 75% or 80%, or it can be other values. In other words, the second sequence can be a primary type sequence when the number of sequence number groups related to the second sequence is greater than the number of sequence number groups related to other sequences. The primary type signal sequence can be predefined or configured, or it can be determined by signaling.

[0014] In one possible implementation of the first or second aspect, the q-th bit among the M second bit indices of the N bit indices is equal to the sum of the q-th bit indices of the third sequence of length M and k2*M, where k2 is an integer greater than or equal to 0.

[0015] Based on this implementation, the first sequence or a portion thereof can be related to the third sequence, ensuring better communication performance. The third sequence can be predefined, configured, or determined through signaling. The second bit sequence number differs from the first bit sequence number.

[0016] In one possible implementation of the first or second aspect, the N bit indices include bit indices in p number groups of length M, where p2 number groups of length M satisfy the following: the q-th bit in the number group is equal to the q-th bit in the third sequence, or the q-th bit in the number group is equal to the sum of the q-th bit in the third sequence and a positive integer multiple of M, where p is a positive integer greater than 1, and p2 is a positive integer greater than 1 and less than p; wherein p2 / p is less than or equal to a second threshold. At least one of the p2 number groups includes M second bit indices.

[0017] Based on this implementation, the proportion of the sequence number group related to the third sequence is relatively small. For example, the second threshold could be 25% or 20%, or it could be any other value. In other words, when the number of sequence number groups related to the third sequence is less than the number of sequence number groups related to other sequences (such as sequences of the primary type), the third sequence can be a sequence of a non-primary type. This ensures better decoding performance and reduces the design complexity of the first sequence.

[0018] In one possible implementation of the first or second aspect, the N bit indices include the 2i-th bit indices and the (2i+1)-th bit indices, i = 0, 1, 2...N / 2-1, and at least y i satisfy: the 2i-th bit indices and the (2i+1)-th bit indices of the N bit indices are less than N / 2, or the 2i-th bit indices and the (2i+1)-th bit indices of the N bit indices are greater than or equal to N / 2; wherein y is a positive integer greater than or equal to 0 and less than or equal to N / 2, and y / (N / 2) is greater than or equal to a third threshold.

[0019] Alternatively, it can be said that the N bit indices are composed of N / 2 indices of length 2. Any indices of length 2 include the 2i-th bit and the (2i+1)-th bit indices of the N bit indices, i = 0, 1, 2...N / 2-1. The bit indices in the x1 indices of the x indices of length 2 are all less than N / 2, and the bit indices in the x2 indices of the x indices of length 2 are all greater than or equal to N / 2. x1 and x2 are both integers greater than or equal to 0 and less than or equal to x. Among them, (x1+x2) / x is greater than or equal to the third threshold.

[0020] Based on this implementation, the probability that the 2ith element and the 2i+1th element in the first sequence are both less than N / 2 or both greater than or equal to N / 2 is not less than the third threshold, which can guarantee good communication performance.

[0021] In one possible implementation of the first or second aspect, y / (N / 2) or (x1+x2) / (N / 2) is positively correlated with N. Alternatively, the third threshold can be said to be positively correlated with N.

[0022] Based on this implementation, y / (N / 2) or (x1+x2) / x increases with N and decreases with N. Therefore, when the code length is longer, the proportion of bits in the first sequence that satisfy the condition that the 2i-th bit and the (2i+1)-th bit are both less than N / 2 or both are greater than or equal to N / 2 is larger, which can ensure better communication performance.

[0023] In one possible implementation of the first or second aspect, the first sequence satisfies the following characteristic: for i = 0, 1, 2...N / 2-1, the 2i-th bit number and the (2i+1)-th bit number are less than N / 2, or the 2i-th bit number and the (2i+1)-th bit number are greater than or equal to N / 2.

[0024] This implementation method ensures good decoding performance and reduces design complexity.

[0025] In one possible implementation of the first or second aspect, M = 8, the second or third sequence includes at least one of the following, and the second sequence is different from the third sequence: 0 1 2 3 5 4 6 7; 0 2 1 4 3 5 6 7; 0 1 2 4 3 6 5 7; 0 1 2 4 6 3 5 7; 0 1 2 4 5 3 7 6;

[0031] M = 16, the second sequence or the third sequence includes at least one of the following, and the second sequence is different from the third sequence: 0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15; 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15; 0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15; 0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15; 0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15; 0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15; 0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15; 0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15; 0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15;

[0041] M = 1024, and the second or third sequence is:

[0042] [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7129 66 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22136 260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192544 70 44 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84138 145 261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 14846 75 266 273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112135 78 289 194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101147 176 142 530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 9247 267 385 546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269108 578 224 166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87197 116 170 61 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201336 62 282 143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284648 94 204 298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115167 225 326 306 772 157656 329 110 117 212 171 776 330 226 549 538 387 308216 416 271 279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179228 338 312 704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527582 556 181 295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396344 586 645 593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832588 186 646 404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449217 408 609 596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218368 652 230 391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314424 395 673 583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452397 403 207 674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398346 456 358 405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419406 464 680 801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792802 611 602 410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613422 425 451 614 543 235 412 343 372 775 317 222 426453 237 559 833 804 712834 661 808 779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898781 376 428 665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245458 666 620 363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790460 249 682 573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481574 413 603 366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713632 482 806 427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716864 810 606 912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378459 622 627 437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462442 441 469 247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685844 633 711 253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473634 744 852 960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811379 697 431 607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868819 814 439 929 490 623 671 739 916 463 843 381 497 930 821 726 961 872492631 729 700 443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687903 825 500 846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828753 854 857 504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858478 968 383 910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922874 918 502 933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882937 963 747 505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830911 871 639 888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923972 761 877 952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980926 764 941 967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000892 950 863 759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887985 997 986 943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 10041010 957 983 958 987 1012 999 1016 767 989 1003 990 1005 959 1011 10138951006 1014 1017 1018 991 1020 1007 1015 1019 1021 1022 1023]。

[0043] Based on this implementation, one or more of the above sequences can be used as a second sequence. When the above sequences are used as the second sequence, better communication performance can be achieved. Optionally, one or more of the above sequences can be used as a third sequence, wherein the second sequence is different from the third sequence.

[0044] In one possible implementation of the first or second aspect, M = 8, and the second sequence is: 0 1 2 3 5 4 6 7;

[0046] M=16, the second sequence is: 0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15;

[0048] M = 1024, the second sequence is:

[0049] [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7129 66 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22136 260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192544 70 44 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84138 145 261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 14846 75 266 273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112135 78 289 194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101147 176 142 530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 9247 267 385 546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269108 578 224 166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87197 116 170 61 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201336 62 282 143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284648 94 204 298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115167 225 326 306 772 157656 329 110 117 212 171 776 330 226 549 538 387 308216 416 271 279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179228 338 312 704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527582 556 181 295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396344 586 645 593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832588 186 646 404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449217 408 609 596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218368 652 230 391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314424 395 673 583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452397 403 207 674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398346 456 358 405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419406 464 680 801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792802 611 602 410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613422 425 451 614 543 235 412 343 372 775 317 222 426453 237 559 833 804 712834 661 808 779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898781 376 428 665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245458 666 620 363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790460 249 682 573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481574 413 603 366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713632 482 806 427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716864 810 606 912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378459 622 627 437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462442 441 469 247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685844 633 711 253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473634 744 852 960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811379 697 431 607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868819 814 439 929 490 623 671 739 916 463 843 381 497 930 821 726 961 872492631 729 700 443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687903 825 500 846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828753 854 857 504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858478 968 383 910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922874 918 502 933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882937 963 747 505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830911 871 639 888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923972 761 877 952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980926 764 941 967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000892 950 863 759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887985 997 986 943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 10041010 957 983 958 987 1012 999 1016 767 989 1003 990 1005 959 1011 10138951006 1014 1017 1018 991 1020 1007 1015 1019 1021 1022 1023]。

[0050] Based on this implementation, the second sequence mentioned above can be used as a sequence of the primary type. When the sequence of the primary type is one of the above sequences, better communication performance can be achieved.

[0051] In one possible implementation of the first or second aspect, M = 8, and the third sequence includes at least one of the following: 0 2 1 4 3 5 6 7; 0 1 2 4 3 6 5 7; 0 1 2 4 6 3 5 7; 0 1 2 4 5 3 7 6;

[0056] M = 16, and the second or third sequence includes at least one of the following: 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15; 0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15; 0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15; 0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15; 0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15; 0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15; 0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15;

[0064] 0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15.

[0065] Based on the above implementation, one or more of the sequences mentioned above can be used as a third sequence. This third sequence can be a sequence of a non-primary type. When the non-primary type sequence is one of the above sequences, better communication performance can be achieved.

[0066] Thirdly, a communication device is provided. The device can implement the methods described in any one of the first to second aspects and any possible implementations thereof. The device possesses the functions of the first or second communication device described above. The device is, for example, a terminal device, a functional module within a terminal device, a network device, or a functional module within a network device, etc.

[0067] In one optional implementation, the device may include modules corresponding one-to-one with the methods / operations / steps / actions described in any of the first to second aspects and any possible implementations thereof. These modules may be hardware circuits, software, or a combination of hardware circuits and software. In another optional implementation, the device includes a processing unit (sometimes also called a processing module) and a communication unit (sometimes also called a transceiver module, communication module, etc.). The transceiver unit is capable of both sending and receiving functions. When the transceiver unit performs the sending function, it may be called a sending unit (sometimes also called a sending module); when it performs the receiving function, it may be called a receiving unit (sometimes also called a receiving module). The sending unit and the receiving unit may be the same functional module, referred to as the transceiver unit, which performs both sending and receiving functions; or, the sending unit and the receiving unit may be different functional modules, with the transceiver unit being a collective term for these functional modules.

[0068] For example, when the apparatus is used to perform the method described in any one of the first to second aspects, the apparatus may include a communication unit and a processing unit.

[0069] Fourthly, embodiments of this application also provide a communication device, including a processor for executing a computer program (or computer-executable instructions) stored in a memory, which, when executed, causes the device to perform the method as described in any one of the first to second aspects and any possible implementation thereof.

[0070] In one possible implementation, the processor and memory are integrated together;

[0071] In another possible implementation, the memory is located outside the communication device.

[0072] The communication device also includes a communication interface for communicating with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0073] Fifthly, a computer-readable storage medium is provided for storing a computer program or instructions that, when executed, cause the methods described in any of the first to second aspects and any possible implementations thereof, and the methods shown in any possible implementations thereof, to be implemented.

[0074] A sixth aspect provides a computer program product containing instructions that, when run on a computer, enables the method described in any of the first to second aspects and any possible implementation thereof to be implemented.

[0075] In a seventh aspect, embodiments of this application also provide a communication device for performing the method described in any one of the first to second aspects and any possible implementation thereof.

[0076] Eighthly, a chip system is provided, comprising logic circuitry (or, as understood, a processor, which may include logic circuitry, etc.), and further comprising input / output interfaces. The input / output interfaces can be used to input messages or to output messages. The input / output interfaces can be the same interface, i.e., the same interface can implement both sending and receiving functions; or, the input / output interface includes an input interface and an output interface, the input interface being used to implement the receiving function, i.e., to receive messages; and the output interface being used to implement the sending function, i.e., to send messages. The logic circuitry can be used to perform operations other than the sending and receiving functions in the methods described in any of the first to second aspects and any possible implementations thereof; the logic circuitry can also be used to transmit messages to the input / output interfaces or to receive messages from other communication devices from the input / output interfaces. The chip system can be used to implement the methods described in any of the first to second aspects and any possible implementations thereof. The chip system can be composed of chips or can include chips and other discrete devices.

[0077] Optionally, the chip system may also include a memory, which can be used to store instructions, and the logic circuits can call the instructions stored in the memory to implement the corresponding functions.

[0078] Ninth aspect, a communication method is provided, which may include the method implemented by a first communication device as shown in the first aspect and any possible implementation thereof, and the method implemented by a second communication device as shown in the second aspect and any possible implementation thereof.

[0079] A tenth aspect provides a communication system, which may include a first communication device and a second communication device. The first communication device may be used to implement the method shown in the first aspect and any possible implementation thereof, and the second communication device may be used to implement the method shown in the second aspect and any possible implementation thereof.

[0080] The technical effects brought about by the third to tenth aspects above can be found in the descriptions of the beneficial effects of the corresponding solutions in the first and second aspects above, and will not be repeated here. Attached Figure Description

[0081] Figure 1 This application provides a schematic diagram of the architecture of a wireless communication system.

[0082] Figure 2A schematic diagram illustrating an encoding and decoding process provided for an embodiment of this application;

[0083] Figure 3(a) is a schematic diagram of a polarization coding provided in an embodiment of this application;

[0084] Figure 3(b) is a schematic diagram of a serial cancellation decoding method provided in an embodiment of this application;

[0085] Figure 3(c) is a schematic diagram of an SCL decoding method provided in an embodiment of this application;

[0086] Figure 4 and Figure 6 These are schematic flowcharts illustrating a communication method provided in an embodiment of this application;

[0087] Figure 5 A schematic diagram of a first sequence provided in an embodiment of this application;

[0088] Figure 7 and Figure 8 These are schematic diagrams of a communication device provided in the embodiments of this application. Detailed Implementation

[0089] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0090] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, Wireless Fidelity (Wi-Fi), Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, 5G mobile communication systems (such as NR systems), Future Communication Systems, or other similar communication systems, and are not limited thereto. The embodiments of this application use... Figure 1 The communication system shown is used as an example for description. When the technical solutions of the embodiments of this application are applied to other communication systems, the devices, components, modules, etc. in the embodiments can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0091] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application. Figure 1 As shown, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as... Figure 1 110a and 110b may also include at least one terminal device, such as Figure 1 The series consists of 120a-120j. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example... Figure 1The mobile phones included are 120a, 120e, 120f, and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e, and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can connect to micro-station 110b, connect to laptop 120g, and connect to printer 120h. Mobile phone 120j can control drone 120i.

[0092] The communication system provided in this application may also include AI network elements for implementing some or all AI-related operations. AI network elements can also be referred to as AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI ​​network elements may be built into the network elements of the communication system. For example, an AI network element may be an AI module built into: access network equipment, core network equipment, cloud server, or operation, administration, and maintenance (OAM) to implement AI-related functions. The OAM may act as the network management system for core network equipment and / or access network equipment. Alternatively, the AI ​​network element may also be an independently configured network element in the communication system. Optionally, the terminal or its built-in chip may also include AI entities for implementing AI-related functions.

[0093] (1) Network equipment

[0094] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device in a radio access network (RAN) that provides wireless communication capabilities to terminal devices; this is called RAN equipment. The RAN can be an access network within the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.

[0095] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.

[0096] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a CU control plane (CP) (i.e., CU-CP) and a CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the radio link control (RLC) layer and medium access control (MAC) layer of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. The CU and DU can be set up separately, or they can be included in the same network element, such as in the baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. RAN equipment can be a macro base station (such as...) Figure 1 110a in the text), can also be a micro base station or an indoor station (such as... Figure 1 In 110b), it can also be a relay node or a donor node, etc. The embodiments of this application do not limit the specific technology or device form used in the network equipment.

[0097] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0098] (2) Terminal equipment

[0099] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as D2D communication, V2X communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicle devices (such as vehicle units, in-vehicle modules, in-vehicle chips, onboard units (OBUs) or telematics boxes (T-BOXs)), drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, satellite terminals, Internet of Things (IoT) terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability UE (REDCAP UE), etc. In the embodiments of this application, the device used to implement the functions of the terminal device can be the terminal device itself, or a device capable of supporting the terminal device in implementing that function, such as a chip system or a combination of devices or components capable of implementing the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.

[0100] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device that includes the functions of the terminal device.

[0101] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

[0102] The roles of network devices and terminal devices can be relative, for example, Figure 1 The helicopter or drone 120i can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol; in this case, 120i is also a network device relative to 110a. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. Figure 1 110a and 110b can be referred to as communication devices with network equipment functions. Figure 1 The 120a-120j in the text can be referred to as communication devices with terminal equipment functions.

[0103] Network devices and terminal devices, network devices and network devices, and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.

[0104] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0105] The following is an explanation of the relevant terms used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.

[0106] (1) Channel coding and channel decoding

[0107] Figure 2 This is a schematic diagram illustrating a processing flow between the information source and the information sink. For example... Figure 2As shown, the transmitting end (i.e., the source) obtains the bit sequence to be encoded (i.e., the information bit sequence) through source coding, and then performs channel coding on the bit sequence to be encoded to obtain the encoded bit sequence. Correspondingly, after the receiving end (i.e., the sink) obtains the symbol sequence to be decoded, it performs channel decoding on the symbol sequence to be decoded to obtain the information bit sequence, and then performs source recovery on the information bit sequence to obtain useful information.

[0108] Since source coding does not consider interference resistance, if the bit sequence output from source coding is directly transmitted through the channel, noise interference in the channel will cause bit errors, reducing communication reliability. Therefore, channel coding, which encodes the bit sequence output from source coding again, can improve communication reliability. Channel decoding is the inverse process of channel coding.

[0109] There are various channel coding methods, such as polar coding or low-density parity-check (LDPC) coding. Polar codes were selected as the control channel coding method in the 5G standard. Polar codes are a coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity, and have the advantages of good decoding performance and low complexity. LDPC codes were selected as the data channel coding method in the 5G standard. LDPC codes are linear block codes with a sparse parity-check matrix, which not only have good performance approaching the Shannon limit, but also have low decoding complexity and flexible structure.

[0110] (2) Modulation and demodulation

[0111] See Figure 2 As shown, the transmitting end can also map the encoded bit sequence to the modulation symbol sequence, and then transmit the modulation symbol sequence; correspondingly, the receiving end can receive the modulation symbol sequence and then demodulate it to obtain the symbol sequence to be decoded.

[0112] Modulation refers to the process by which the transmitting end maps the encoded bit sequence to a constellation based on a constellation diagram to obtain a modulated symbol sequence. Demodulation is the inverse process of modulation. Common modulation methods include quadrature amplitude modulation (QAM) and amplitude shift keying (ASK) modulation.

[0113] (3) Information bit sequence

[0114] An information bit sequence refers to a sequence of bits to be transmitted. For example, if the bits to be transmitted are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the resulting information bit sequence is 10101100101. In this application, K represents the length of the information bit sequence. The information bits may include payload bits. Optionally, the information bits may also include check bits, such as cyclic redundancy check (CRC) bits.

[0115] (4) Code length

[0116] Code length refers to the length of the bit sequence to be transmitted obtained by encoding the information bit sequence. The code length is greater than or equal to the length of the information bit sequence. In this application, N represents the code length.

[0117] (5) Bitrate

[0118] The code rate is the ratio of the length of the information bit sequence to the code length. In this application, R represents the code rate, therefore R = K / N.

[0119] The length, code length, and code rate of the information bit sequence can be pre-configured by higher-layer signaling, MAC layer signaling, or downlink physical layer signals, and can also be obtained or calculated by the transmitting and receiving devices. For example, the transmitting and receiving devices can determine the code length based on the coding method, the frame structure used to transmit the information bits, the number of layers, and the modulation scheme. For example, the transmitting and receiving devices can obtain the code rate based on higher-layer signaling, MAC layer signaling, or downlink physical layer signals, or determine the code rate based on the modulation and coding scheme (MCS).

[0120] (6) Rate matching

[0121] Rate matching refers to removing some bits from the encoded bit sequence without transmitting them, or repeating some bits.

[0122] The rate matching method will be further explained in three categories below.

[0123] Punching: Punching refers to directly creating holes in certain bit positions within the encoded bit sequence without transmitting them, thus generating bit sequences of arbitrary length. On the decoding side, since there is no information at the corresponding punctured positions, the log-likelihood ratio (LLR) of the corresponding bit is set to 0.

[0124] Shortening: Shortening involves fixing certain bit positions in the encoded bit sequence so that they do not need to be transmitted. On the decoding side, since the corresponding "shortened" positions are known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity.

[0125] Repetition: "Repetition" refers to obtaining a longer bit sequence by repeatedly sending a portion of the encoded bit sequence.

[0126] Taking polar codes as an example, when using a regular polar kernel, the encoding length (i.e., the mother code length) of a polar code is an integer power of 2. In practical applications, the required length may be a non-encoded length. In this case, it is necessary to remove some bits from the encoded bit sequence without transmitting them, or to repeatedly transmit some bits.

[0127] (7) Polar code

[0128] (7.1) Polar coding

[0129] Polar codes employ encoding strategies that utilize noiseless channels to transmit useful user information, or utilize noisy channels to transmit agreed-upon information or no information at all. The generator matrix of a polar code is G. N Its encoding process is as follows It is a binary row vector with length N. With the generating matrix G N After multiplication, we get the encoded bit sequence; the multiplication process is the encoding process.

[0130] During the encoding process of polar codes, A portion of the bits are used to carry information, called the information bit index set, and the set of these bit indices is denoted as A; the other portion of the bits are set to fixed values ​​agreed upon in advance by the receiver and the transmitter, called the fixed bit set or frozen bit set. The set of bit indices in the frozen bit set is denoted by the complement of A, A''. c These freeze bits are typically set to 0, but they can be set arbitrarily as long as the receiver and sender agree in advance.

[0131] In NR, the frozen bits and information bits of the polar code are determined based on the reliability sequence corresponding to the mother code length N. The reliability sequence corresponding to the mother code length can be calculated offline to reduce the encoding complexity. For example, the reliability sequence can be obtained by sorting N bit indices in ascending order of reliability. The element value in this sequence is a bit indic, and each bit indic corresponds to one bit. A bit can be understood as a sub-channel. A sub-channel can also be called a polar channel or a bit sub-channel. A bit indic can represent or correspond to a sub-channel, or in other words, a bit indic can be the indices of a sub-channel. The mother code length is an integer power of 2, which is the length of the bit sequence after polar code encoding; the mother code length can also be called the encoding length. During the encoding process, the K bits with the highest reliability can be read from the reliability sequence according to reliability order as the information bit index set. Taking a master code length of 8 as an example, assuming the reliability sequence is [0 1 2 4 3 5 6 7], the reliability of the bits from highest to lowest is as follows: the bit corresponding to bit number 7, the bit corresponding to bit number 6, the bit corresponding to bit number 5, the bit corresponding to bit number 3, the bit corresponding to bit number 4, the bit corresponding to bit number 2, the bit corresponding to bit number 1, and the bit corresponding to bit number 0. The bit number can be understood as an index or identifier for the bit. For example, when constructing a polar code with a master code length of 8 and an information bit sequence length of 4, the bits corresponding to bit numbers 7, 6, 5, and 3 are selected from the end to the beginning as information bits, while the bits corresponding to bit numbers 4, 2, 1, and 0 are selected as frozen bits.

[0132] In this application, the reliability of the bit sequence number can be represented by the log-likelihood ratio (LLR) of the sub-channel. A larger LLR indicates higher reliability of the bit sequence number, while a smaller LLR indicates lower reliability.

[0133] Figure 3(a) shows an 8×8 polarization transformation matrix, where the left side can be understood as the side to be encoded, and the bits on the left are represented by u. The right side can be understood as the encoding side (or codeword side), and the bits on the right are represented by x. The process from left to right is the process of the transmitter encoding the bit sequence to be encoded. The information bits to be encoded are represented by the sequence u(0, 0, 0, 0, 0, 0, 1, 1). After the polarization transformation matrix, the encoded bits are represented by the sequence x(0, ​​1, 0, 1, 0, 1, 0, 1). Then, x is mapped to a modulation symbol for transmission in channel W. The bits corresponding to high channel reliability are used to map information bits, and the bits corresponding to low channel reliability are used to map frozen bits. As shown in Figure 3(a), {u0, u1, u2, u4} are frozen bits, i.e., the positions of frozen bits, and {u3, u5, u6, u7} are information bits, i.e., the positions of information bits. In this embodiment, information bits are also called information bits, and frozen bits are also called frozen bits.

[0134] It is understandable that the value of the frozen bit can be 0 or 1. Figure 3(a) is used as an example where all the frozen bits are 0, that is, in Figure 3(a), u0 = 0, u1 = 0, u2 = 0, u4 = 0.

[0135] Referring to Figure 3(a), in the encoding process, two adjacent columns constitute a coding layer. The left column of bits represents the input bits of the coding layer, and the right column represents the output bits. For example, in the leftmost coding layer, the input bit sequence is (0, 0, 0, 0, 0, 0, 1, 1), and the output bit sequence is (0, 0, 0, 0, 0, 0, 0, 1). The operation symbols in the middle of the coding layer... This represents the XOR operation, specifically... express The bits in the current row and A single XOR operation between the bits in the row. The bits on the right represent the result of the operation. For example, in the leftmost coding layer, the first input bit (value 0) and the second input bit (value 0) are processed... The operation yields the first output bit (with a value of 0).

[0136] (7.2) Polarization Decoding

[0137] There are several methods for decoding polar codes, such as successive cancellation (SC) decoding and successive cancellation list (SCL) decoding.

[0138] The SC decoding method refers to calculating the LLR of each decoded bit sequentially based on the LLR sequence corresponding to the bit sequence to be decoded, and making a bit-by-bit decision. When the decoded bit is an information bit, if the LLR of the decoded bit is greater than 0, then the decoded bit is 0; if the LLR of the decoded bit is less than 0, then the decoded bit is 1. When the decoded bit is a fixed bit, the decoding result is set to 0 regardless of the LLR value. Figure 3(b) is a schematic diagram of the SC decoding calculation process. Taking 4 decoded bits as an example, there are 8 calculation nodes in Figure 3(b), including 4 f nodes and 4 g nodes. The f nodes and g nodes correspond to the f operation and the g operation, respectively. The operation of the f node requires the two LLR inputs on its right side, and the operation of the g node requires the two LLR inputs on its right side and the output of the previous stage as inputs. Only after the input items are calculated can the output be calculated. According to the above calculation rules, the decoded bits obtained by calculating sequentially from the right side in Figure 3(b) are ①→②→③→④, and the decoding is completed.

[0139] The SCL decoding method refers to using the LLR sequence corresponding to the bit sequence to be decoded. When decoding each information bit, the decoding results corresponding to 0 and 1 are saved as two branch decoding paths (referred to as path splitting). Figure 3(c) shows a schematic diagram of the decoding paths in the SCL decoding method. As shown in Figure 3(c), each level represents one decoded bit. If the decoding result is 0, the path is developed along the left subtree; if the decoding result is 1, the path is developed along the right subtree. When the total number of decoding paths exceeds the preset path width L (generally L = 2, 4, 8, 16, or 32), the L paths with the best path metric (PM) value are selected, saved, and the path is further developed to decode subsequent bits. The PM value is used to judge the quality of the path, and the PM value is calculated using LLR. For each level of decoded bits, the PM values ​​of the L paths are sorted in ascending order, and the correct path is selected based on the PM value. This process is repeated until the last bit is decoded.

[0140] Polar codes have been selected as the control channel coding scheme in 5G communication standards. Polar codes are a coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity and have the advantages of good decoding performance and low complexity.

[0141] Currently, the maximum length of reliability sequences supported by 5G NR systems is 1024. How to construct polar coding for reliability sequences longer than 1024 is a technical problem that urgently needs to be solved.

[0142] To address the aforementioned issues, this application provides corresponding solutions.

[0143] The methods provided in the embodiments of this application will be described in detail below. Figure 4This is a flowchart illustrating a communication method provided in an embodiment of this application. The method can be executed by a first device. Unless otherwise specified, the "first device" in this application can refer to a first equipment (e.g., a terminal or access network node), a component (e.g., a communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first equipment. A component can also be replaced by a device or function. The component can be located within the first equipment. Similarly, the "second device" in this embodiment can refer to a second equipment (e.g., a terminal or access network node), a component (e.g., a communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the second equipment. A component can also be replaced by a device or function. The component can be located within the second equipment.

[0144] In this application, the first device can act as a transmitting side or an encoding side, and the second device can act as a receiving side or a decoding side. For example, the first device or the first equipment can send information or data to the second device or the second equipment. Specifically, during uplink communication, the first equipment can be a terminal, and the second equipment can be an access network device; during downlink communication, the first equipment can be an access network device, and the second equipment can be a terminal. Furthermore, this application does not exclude applications in terminal-to-terminal communication scenarios, in which case the transmitting device and the receiving device can each be a terminal.

[0145] like Figure 4 As shown, with the first device as the executing entity, the method may include the following steps:

[0146] S101: The first device acquires the information bit sequence.

[0147] In this application, the information bit sequence can be a sequence comprising multiple information bits, each of which can have a value of 0 or 1. An information bit can refer to the payload itself, or to the payload and parity bits. The length of the information bit sequence is K.

[0148] The payload can be a sequence of bits to be transmitted. For example, if the bits to be transmitted are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the resulting information bit sequence could be 10101100101. Similarly, in Figure 3(a), if the information bits are u3 = 0, u5 = 0, u6 = 1, and u7 = 1, then the information bit sequence could be 0011.

[0149] The check bits can be obtained from the payload. For example, the check bits are CRC bits, parity bits, or check bits corresponding to other check methods. That is, the information bits can be a sequence of payload and one or more CRC bits.

[0150] In this application, the length K of the information bit sequence can refer to the number of bits contained in the information bit sequence. For example, if the information bit sequence includes a payload but does not include a parity bit, the length K of the information bit sequence can be the payload length. As another example, if the information bit sequence includes both a payload and a parity bit, the length K of the information bit sequence can be the sum of the payload length and the parity bit length.

[0151] S102: The first device performs polar coding on the information bit sequence according to the first sequence of length N to obtain the polar-coded bit sequence.

[0152] The first sequence is described below.

[0153] In this application, the first sequence includes N bit indices, which are ordered according to their reliability. For example, the bit indices in the first sequence are ordered from lowest to highest reliability. The bit indices can also be called sequence numbers.

[0154] The q-th bit among the M first bits of the N bits in the first sequence is equal to the sum of the q1-th bit of the second sequence of length M and k1*M, where 0 ≤ q1 ≤ M-1, k1 is an integer greater than or equal to 0, and N is 2048 or 4096. Alternatively, it can be stated that the M first bits among the N bits are related to the second sequence of length M, or that the M first bits among the N bits correspond to the second sequence of length M. It can also be said that the q-th bit among the M first bits is equal to the q-th bit of the second sequence of length M, or that the q-th bit among the M first bits is equal to the sum of the q-th bit of the second sequence of length M and a positive integer multiple of M. Here, M is a positive integer, and M is less than N.

[0155] Optionally, the first sequence is a reliability sequence with a length greater than 1024. The length of the first sequence can be an integer power of 2. For example, the length N of the first sequence is 2048, 4096, or other values.

[0156] The second sequence will be explained below.

[0157] The second sequence can be a sequence of length M.

[0158] In one possible implementation, the second sequence can be a reliability sequence of length M. M can be an integer power of 2. That is, the second sequence can be composed of M bit indices sorted according to their reliability. For example, the second sequence can be composed of M bit indices sorted in ascending order of their reliability.

[0159] It can be assumed that the order of the M first bit indices related to or associated with the second sequence in the first sequence is the same as or corresponds to the order of these bit indices in the second sequence. For example... Figure 5 As shown, the N bit indices in the first sequence include M first bit indices, denoted as A0, A1, A2, A3…A M-1 Additionally, the second sequence of length M is denoted as a0, a1, a2, a3…a M-1 Where A0 = a0 + k1 * M, A1 = a1 + k1 * M, A2 = a2 + k1 * M, and so on. k1 can be an integer greater than or equal to 0. It can also be said that a0 is related to A0, a1 is related to A1, and so on.

[0160] Alternatively, it can be considered that the q1-th bit index A in the M first bit indices of the first sequence is... q1 With the q1-th bit index a in the second sequence q1 Satisfy: A q1 =a q1 +k1*M, where q = 0, 1, 2...M-1, and k1 is an integer greater than or equal to 0.

[0161] It can be assumed that the value of k1 can be... This represents rounding down to the nearest integer.

[0162] For example, if k1 = 0, then the order of bit numbers 0, 1, 2...M-1 in the first sequence is the same as the order of bit numbers 0, 1, 2...M-1 in the second sequence; if k1 = 1, then the order of bit numbers M, M+1, M+2...2M-1 in the first sequence is the same as the order of bit numbers 0, 1, 2...M-1 in the second sequence, and so on.

[0163] Optional, A0, A1, A2, A3…A M-1 The position in the first sequence can be continuous or non-contiguous, without specific limitations. (Still using...) Figure 5 For example, if bit indices a1 and a2 are consecutive in the second sequence, then correspondingly, bit indices A1 and A2 are consecutive in the first sequence. Similarly, if bit indices a0 and a1 are consecutive in the second sequence, then correspondingly, bit indices A0 and A1 are not consecutive in the first sequence. For instance, there is at least one bit indices b between bit indices A0 and A1 in the first sequence. Furthermore, if two bit indices are not consecutive in the second sequence, then the corresponding bit indices in the first sequence are also not consecutive. For example, if a0 and a2 are not consecutive in the second sequence, then correspondingly, the bit indices A0 (corresponding to a0) and A2 (corresponding to a2) are not consecutive in the first sequence.

[0164] Taking M=8 and the second sequence as [0 1 2 3 5 4 6 7] as an example, when k1=0, the N bits of the first sequence can be 0 1 2 3 5 4 6 7, that is, the reliability of the sub-channels corresponding to the bit numbers 0 1 2 3 5 4 6 7 in the first sequence are sorted from low to high; when k1=1, the M bits of the first sequence can be 0 1 2 3 5 4 6 7, that is, the reliability of the sub-channels corresponding to the bit numbers 8 9 10 11 13 12 14 15 in the first sequence are sorted from low to high.

[0165] Additionally, the N bits of the first sequence may include M second bits related to the third sequence. The q-th bit of these M second bits is equal to the sum of the q-th bit of the third sequence of length M and k2*M, where q = 0, 1, 2…M-1, and k2 is an integer greater than or equal to 0. For example, the value of k2 could be… Alternatively, we can say that the q-th bit in the M second-order bits is equal to the q-th bit in the third sequence of length M, or that the q-th bit in the M second-order bits is equal to the sum of the q-th bit in the third sequence of length M and a positive integer multiple of M. The second and third sequences can be different.

[0166] In this application, the second bit sequence number is different from the first bit sequence number.

[0167] Alternatively, it can be stated that M second bits out of N bit indices are related to a third sequence of length M, or that M second bits out of N bit indices correspond to a third sequence of length M. Where the second and third sequences are different, the bit indices in the first sequence related to the second sequence are different from the bit in the first sequence related to the third sequence.

[0168] The third sequence can be found in the description of the second sequence. For example, the third sequence is a reliability sequence of length M, meaning it consists of M bits ordered according to their reliability. For instance, the third sequence consists of M bits ordered from lowest to highest reliability. The difference between the second and third sequences is that the order of the same bit in the second sequence differs from its order in the third sequence.

[0169] It can be assumed that the N bit indices in the first sequence, or a subset of the bit indices in the N sub-channels, can be composed of p index groups. Alternatively, the N bit indices in the first sequence, or a subset of the bit indices in the N sub-channels, include the bit indices in the p index groups. Each index group contains M bit indices. Index groups can also be called bit index groups. At least one index group satisfies the following: the q-th bit in the index group is equal to the q-th bit in the second sequence, or the q-th bit in the index group is equal to the sum of the q-th bit in the second sequence and a positive integer multiple of M. Where k1 ≠ 0, the positive integer multiples of M include k1 * M. Alternatively, at least one sequence number group includes M first bit numbers, where the q-th bit number among the M first bit numbers is equal to the q-th bit number in the second sequence, or the q-th bit number among the M first bit numbers is equal to the sum of the q-th bit number in the second sequence and a positive integer multiple of M.

[0170] For ease of explanation in the following text, these p groups of numbers can be referred to as the group of numbers corresponding to the first sequence.

[0171] Furthermore, at least one sequence number group satisfies the following: the q-th bit in the sequence number group is equal to the q-th bit in a third sequence of length M, or the q-th bit in the sequence number group is equal to the sum of the q-th bit in the third sequence and a positive integer multiple of M. Where k2 ≠ 0, the positive integer multiple of M includes k2 * M. Alternatively, at least one sequence number group comprises M second bit indices, where the q-th bit in the M second bit indices is equal to the q-th bit in the third sequence, or the q-th bit in the M second bit indices is equal to the sum of the q-th bit in the third sequence and a positive integer multiple of M.

[0172] In one possible embodiment, the N bits in the first sequence can be divided into p number groups, each number group consisting of M bits. In this sequence, the bit indices in the sequence group are consecutive. For example, the bit indices in any sequence group are k*M, k*M+1, k*M+2...k*M+M-1, where k = 0, 1, 2...p-1.

[0173] S103: The first device outputs the polarized encoded bit sequence.

[0174] In S103, the first device outputs a polar-coded bit sequence after operations such as rate matching and / or modulation.

[0175] In S103, "output" can refer to output via the air interface or output to other devices or modules via the internal interface of the device.

[0176] based on Figure 4 The method shown can perform polar coding on an information bit sequence based on a first sequence of length N, where N is 2048, 4096, or other values, thus enabling polar coding based on a reliability sequence of length greater than 1024. Specifically, the q-th bit in the M first bit indices of the first sequence is equal to the sum of the q1-th bit in the second sequence of length M and k1*M, ensuring good communication performance.

[0177] The following describes the possible implementations of the second sequence.

[0178] In one possible embodiment, one or more sequence number groups among the p sequence number groups can be considered to be related to sequence number groups in the sequence number group set. For ease of distinction, the sequence number groups in the sequence number group set will be referred to as sequence number sequences or bit sequence number sequences. In this application, a sequence number sequence can be a sequence composed of M bit numbers ordered according to their reliability. Specifically, one or more sequence number groups among the p sequence number groups can be related to one or more sequence number sequences in the sequence number group set. For example, any sequence number group among the p sequence number groups can be related to a sequence number sequence in the sequence number group set. Furthermore, multiple sequence number groups among the p sequence number groups can be related to a sequence number sequence in the sequence number group set.

[0179] For example, the sequence of numbers in the set of number groups may include a second sequence and / or a third sequence. The relationship between a number group and a sequence of numbers in the set of number groups can be understood as follows: the q-th bit in any number group is equal to the q-th bit in a sequence of numbers in the set of number groups, or the q-th bit in any number group is equal to the sum of the q-th bit in a sequence of numbers in the set of number groups and a positive integer multiple of M. The relationship between a number group and a sequence of numbers in the set of number groups can also be described as the relationship between a sequence of numbers and that number group, or in other words, the correspondence between the number group and that sequence.

[0180] It can be assumed that the larger M is (or the longer the sequence number group), the fewer sequence number groups the first sequence can be divided into (or the smaller p is). Therefore, the first sequence can be obtained with a smaller number of sequence number groups, meaning the design complexity and decoding complexity of the first sequence are lower, and correspondingly, the decoding performance of the first sequence is more limited. Conversely, the smaller M is (or the shorter the sequence number group), the more sequence number groups the first sequence can be divided into (or the larger p is). Therefore, the first sequence can be obtained with a larger number of sequence number groups, meaning the design complexity of the first sequence is higher, and correspondingly, the decoding performance of the first sequence is better.

[0181] Alternatively, it can be argued that the fewer the sequence numbers in the set of sequence number groups, or in other words, the fewer the sequence numbers related to the sequence number groups in the p sequence number groups, the lower the design complexity and decoding complexity of the first sequence, and the more limited the decoding performance of the first sequence. Conversely, the more sequence numbers in the set of sequence number groups, or in other words, the more sequence numbers related to the sequence number groups in the p sequence number groups, the higher the design complexity of the first sequence, and the better the decoding performance of the first sequence.

[0182] As an example, when M=8, the sequence of numbers in the set of number groups can include one or more of the following sequence of numbers: [0 1 2 3 5 4 6 7]; [0 2 1 4 3 5 6 7]; [0 1 2 4 3 6 5 7]; [0 1 2 4 6 3 5 7];

[0187] [0 1 2 4 5 3 7 6].

[0188] The above sequence numbers can also be represented in tabular form, where the table can include the reliability ranking information of the bit numbers in the sequence number. When M=8, the sequence number sequences in the sequence number group set can include one or more sequence number sequences from Table 1.

[0189] Table 1

[0190]

[0191] It is understandable that the reliability ranking in Table 1 is determined based on the reliability of the sub-channels. Here, we take a reliability ranking value of 0 to 7 as an example; the reliability ranking value can also be replaced with 1 to 8. The reliability ranking value can also be replaced with the reliability value of the sub-channel. For example, the reliability value of a sub-channel is its LLR (Limited Range Ratio).

[0192] Taking sequence number 1 in Table 1 as an example, arranging the bit numbers in ascending order of reliability yields the sequence [0 12 3 5 4 6 7]. Furthermore, sequence number 2 in Table 1 corresponds to the sequence [0 2 1 4 3 5 6 7], sequence number 3 corresponds to the sequence [0 1 2 4 3 6 5 7], sequence number 4 corresponds to the sequence [0 1 2 4 6 3 5 7], and sequence number 5 corresponds to the sequence [0 1 2 4 5 3 7 6].

[0193] Optionally, when M=8, the second sequence may include one or more of the above sequence numbers. Additionally, the third sequence may include one or more of the above sequence numbers, wherein the second and third sequences are different sequence numbers.

[0194] As another example, when M=16, the sequence of numbers in the set of number groups can include one or more of the following sequence of numbers: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15]; [0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15]; [0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15]; [0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15]; [0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15]; [0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15]; [0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15]; [0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15];

[0203] [0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15].

[0204] The above sequence numbers can also be represented in tabular form, where the table may include the reliability ranking information of the bit numbers in the sequence number. When M=8, the sequence number sequences in the sequence number group set may include one or more sequence number sequences from Table 2.

[0205] Table 2

[0206]

[0207]

[0208] It is understandable that the reliability ranking in Table 2 is determined based on the reliability of the sub-channels. Here, we take a reliability ranking value of 0 to 15 as an example; the reliability ranking value can also be replaced with 1 to 16. The reliability ranking value can also be replaced with the reliability value of the sub-channel. For example, the reliability value of a sub-channel is its LLR (Limited Range Ratio).

[0209] Taking the sequence number 1 in Table 2 as an example, the bit numbers are arranged in ascending order according to reliability, resulting in the sequence number [0 12 4 8 3 5 6 9 10 12 7 11 13 14 15]. Furthermore, in Table 2, sequence 2 corresponds to the sequence [0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15], sequence 3 corresponds to the sequence [0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15], sequence 4 corresponds to the sequence [0 12 4 8 3 5 10 9 6 12 7 11 13 14 15], sequence 5 corresponds to the sequence [0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15], and sequence 6 corresponds to the sequence [0 1 2 4 8 3 5 6 9 10 12 11 7 13]. [14 15], the sequence number 7 in Table 2 corresponds to the sequence number [0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15], the sequence number 8 in Table 2 corresponds to the sequence number [0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15], and the sequence number 9 in Table 2 corresponds to the sequence number [0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15].

[0210] Optionally, when M=16, the second sequence may include one or more of the above numbered sequences. Additionally, the third sequence may include one or more of the above numbered sequences, wherein the second and third sequences are different numbered sequences.

[0211] As another example, when M = 1024, the sequence of numbers in the set of number groups can include the following sequence of numbers:

[0212] [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7129 66 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22136 260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192544 70 44 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84138 145 261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 14846 75 266 273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112135 78 289 194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101147 176 142 530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 9247 267 385 546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269108 578 224 166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87197 116 170 61 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201336 62 282 143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284648 94 204 298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115167 225 326 306 772 157656 329 110 117 212 171 776 330 226 549 538 387 308216 416 271 279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179228 338 312 704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527582 556 181 295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396344 586 645 593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832588 186 646 404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449217 408 609 596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218368 652 230 391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314424 395 673 583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452397 403 207 674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398346 456 358 405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419406 464 680 801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792802 611 602 410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613422 425 451 614 543 235 412 343 372 775 317 222 426453 237 559 833 804 712834 661 808 779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898781 376 428 665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245458 666 620 363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790460 249 682 573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481574 413 603 366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713632 482 806 427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716864 810 606 912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378459 622 627 437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462442 441 469 247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685844 633 711 253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473634 744 852 960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811379 697 431 607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868819 814 439 929 490 623 671 739 916 463 843 381 497 930 821 726 961 872492631 729 700 443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687903 825 500 846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828753 854 857 504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858478 968 383 910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922874 918 502 933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882937 963 747 505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830911 871 639 888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923972 761 877 952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980926 764 941 967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000892 950 863 759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887985 997 986 943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 10041010 957 983 958 987 1012 999 1016 767 989 1003 990 1005 959 1011 10138951006 1014 1017 1018 991 1020 1007 1015 1019 1021 1022 1023]。

[0213] The above sequence of numbers can also be represented in tabular form, where the table can include the reliability ranking information of the bit numbers in the sequence. When M=1024, the sequence of numbers in the sequence group set can include the sequence of numbers in Table 3.

[0214] Table 3

[0215]

[0216]

[0217]

[0218]

[0219] It is understandable that the reliability ranking in Table 3 is determined based on the reliability of the sub-channels. Here, we take a reliability ranking value of 0 to 1023 as an example; the reliability ranking value can also be replaced with 1 to 1024. The reliability ranking value can also be replaced with the reliability value of the sub-channel. The sequence shown in Table 3 is also the NR Polar code sequence.

[0220] Optionally, when M=1024, the second or third sequence may include the above sequence of numbers.

[0221] It can also be understood that the sequence of numbers in the sequence number group set in this application is not limited to the sequence of numbers exemplified in Tables 1 to 3 above.

[0222] In one possible embodiment, a sequence number can be designated as the primary type sequence number. Optionally, sequence number sequences other than the primary type sequence number can be called non-primary type sequence number sequences. Specifically, among the p sequence number groups corresponding to the first sequence, the number of sequence number groups related to the primary type sequence number sequence is greater than the number of other sequence number groups; in other words, the proportion of sequence number groups related to the primary type sequence number sequence among the p sequence number groups is greater than the proportion of sequence number groups related to other sequence number sequences. Other sequence number groups can be sequence number groups among the p sequence number groups that are related to non-primary type sequence number sequences. It can be considered that when one or more sequence number groups are related to the primary type sequence number sequence, better decoding performance can be guaranteed.

[0223] For example, a set of index groups may contain multiple index sequences, including a second sequence and a third sequence. Of the p index groups, p1 are related to the second sequence, and p2 are related to the third sequence, where p1 + p2 ≤ p. If the second sequence is the index sequence of the primary type, then p1 can be required to be greater than p2.

[0224] As an example, it can be required that the proportion of the index groups related to the index sequence of the main type in the p index groups of the first sequence is greater than or equal to a first threshold, in order to maintain good decoding performance. That is, p1 / p is greater than or equal to the first threshold, and the first threshold is greater than 0 and less than or equal to 1. For example, the first threshold can be 75%, 80%, etc., to maintain decoding performance. Alternatively, the first threshold can be considered to be X%, where 0 < X ​​≤ 100.

[0225] Understandably, the larger the value of X, the better the decoding performance of the first sequence.

[0226] Optionally, p1 / p is positively correlated with N. That is, p1 / p increases as N increases and decreases as N decreases. Alternatively, the first threshold X can be considered positively correlated with N. Therefore, with a longer code length, the proportion of sequence groups in the first sequence that are related to the second sequence is larger, which can guarantee the communication performance of the sequence.

[0227] As another example, it can be required that the proportion of index groups related to non-primary type index sequences in the p index groups of the first sequence is less than or equal to a second threshold, in order to maintain good decoding performance while reducing design complexity. The second threshold is greater than 0 and less than. For example, the second threshold is less than the first threshold. For example, the second threshold could be 20%, 25%, etc., to maintain high decoding performance and low complexity of the first sequence. Alternatively, the first threshold can be considered as Y%, where 0 < Y < 100, and Y < X, for example, 0 < X ​​< Y.

[0228] It is understandable that the smaller the value of Y, the better the decoding performance of the first sequence, and the lower the complexity of the first sequence.

[0229] Optionally, p2 / p is negatively correlated with N. That is, p2 / p increases as N increases and decreases as N decreases. Alternatively, the second threshold Y can be considered negatively correlated with N. Therefore, with longer code lengths, the proportion of sequence groups related to the third sequence in the first sequence is smaller, which can ensure the communication performance of the sequence and reduce the complexity of the first sequence design. Alternatively, the proportion of sequence groups related to non-primary type sequence sequences in the first sequence can be considered to decrease as the code length increases.

[0230] Taking the second sequence as an example, the sequence of the primary type can include the third sequence, as well as other sequences besides the second and third sequences.

[0231] Optionally, the sequence number of the primary type can be sequence number 1 in Table 1, sequence number 1 in Table 2, or sequence number in Table 3. Furthermore, it is not excluded that the sequence number of the primary type can be other sequences. Other sequences in Tables 1 and 2, or sequences other than those shown in Tables 1 to 3, can be used as sequence numbers for non-primary types.

[0232] In one possible implementation, the sequence of numbers in the set of number groups may include at least one sequence of numbers.

[0233] One possible implementation is that the set of sequence number groups contains only one sequence number sequence. Correspondingly, one or more sequence number groups among the p sequence number groups can be considered related to this sequence number sequence. This sequence number sequence can be one of the sequence number sequences in the example above, or it can be other sequence number sequences; there are no limitations on this. For example, this sequence number sequence can be sequence number 1 in Table 1, sequence number 1 in Table 2, or a sequence number sequence in Table 3. It is also possible that this sequence number sequence is another type. Optionally, this sequence number sequence can be a sequence number sequence of the primary type, or it can be another type of sequence number sequence. This implementation can reduce the design complexity of the first sequence while maintaining good decoding performance.

[0234] Another possible implementation is that the set of sequence number groups includes multiple sequence number sequences. Accordingly, one or more of the p sequence number groups can be considered to be related to at least one of the multiple sequence number sequences. Optionally, the multiple sequence number sequences may include, for example, some or all of the sequence number sequences shown in Table 1, Table 2 or Table 3.

[0235] The multiple sequence numbers may include sequence numbers of the primary type and / or other sequence numbers.

[0236] In this implementation, any one of the p sequence number groups is related to a sequence number sequence in the sequence number group set, or to a sequence number sequence outside the sequence number group set. Optionally, the minimum proportion of the p sequence number groups that are related to a sequence number sequence in the sequence number group set is positively correlated with N. That is, the minimum proportion of the p sequence number groups that are related to a sequence number sequence in the sequence number group set increases as N increases and decreases as N decreases. Alternatively, this minimum can be considered positively correlated with N. Therefore, with longer code lengths, a larger minimum proportion of the p sequence number groups that are related to a sequence number sequence in the sequence number group set ensures better communication performance of the sequence.

[0237] For example, when N = 2048, the proportion of the p number groups that are related to the sequence number in the set of number groups is no less than 70% or 75%. When N = 4096, the proportion of the p number groups that are related to the sequence number in the set of number groups is no less than 85%.

[0238] As an example of this implementation, at least one of the p sequence number groups is related to the sequence number sequence of the main type, but not to the sequence number sequence of other types. Therefore, the decoding performance can be guaranteed to be close to the optimal performance, and the decoding complexity is low.

[0239] As another example of this implementation, at least one of the p number groups is related to one or more number sequences in Table 1, Table 2 or Table 3 above, but not to other number sequences other than those shown in Table 1, Table 2 and Table 3. Therefore, the decoding performance can be guaranteed to be close to the optimal performance and the decoding complexity is low.

[0240] Optionally, when the number groups in the p number groups are related to the number sequences in Table 1, each number sequence is related to at least one number group, thus ensuring good decoding performance. Taking M=8 as an example, each number sequence in Table 1 is related to at least one number group in the p number groups, thus ensuring good decoding performance and compatibility with NR Polar code sequences. Compatibility with NR Polar code sequences means that the number group corresponding to the NR Polar code sequence can be related to the aforementioned number sequences. For example, the NR Polar code sequence can be divided into multiple number groups of length M=8, and each number sequence in Table 1 is related to at least one number group. For example, in the case of M=8, at least one number group in the p number groups is related to number sequence 1 in Table 1, at least one number group is related to number sequence 2 in Table 1, at least one number group is related to number sequence 3 in Table 1, at least one number group is related to number sequence 4 in Table 1, and at least one number group is related to number sequence 5 in Table 1. Similarly, if the sequence number group in the p sequence number groups is related to the sequence number sequence in Table 2, then each sequence number sequence in Table 2 is related to at least one sequence number group in the p sequence number groups.

[0241] In this application, the first sequence can be considered to be known to the first device. For example, the first sequence can be predefined by a standard, preconfigured by the network, or determined by signaling between the first device and the second device. The signaling can be RRC messages, MAC control elements (CE), or downlink control information (DCI) sent between the first device and the second device.

[0242] The sequence of numbers in the sequence number group set can be predefined by a standard, preconfigured by the network, or determined by signaling between the first device and the second device.

[0243] Alternatively, the first sequence or a portion thereof can be considered to be obtained from the sequence number. For example, the sequence number can be extended using sequence expansion, and the expanded sequence can be used to obtain the first sequence. Optionally, the first sequence or a portion thereof can be obtained from any sequence number using Frank expansion, polarization weight (PW) construction, or other expansion methods. For example, a sequence of length M can be extended to 2... n A sequence of length M, the first sequence or a portion of the first sequence is this 2 n M is a sequence of length, and n is a positive integer.

[0244] The following example, using n=1, illustrates an exemplary method for expanding an M-length sequence of numbers into a 2M-length sequence. Here, a portion of the first sequence is the 2M-length sequence, or, in other words, a portion of the first sequence is the sequence obtained by adding an integer multiple of M to each bit in the 2M-length sequence; or, the first sequence is the 2M-length sequence, or, in other words, the first sequence is the sequence obtained by adding an integer multiple of M to each bit in the 2M-length sequence. Alternatively, the first sequence or a portion of the first sequence can be considered to consist of p number groups, which satisfy the description in this application, i.e., the p number groups can be the p number groups corresponding to the first sequence, where a portion of the first sequence can include the 2M-length sequence.

[0245] It can be assumed that the 2M-long sequence includes two number groups of length M, both of which are related to the M-long number sequence.

[0246] This extension method is, for example:

[0247] The length is determined to be 2 based on the sequence number. n The fourth sequence, a fifth sequence of length M, and a sixth sequence of length M are used to determine a 2M-length sequence. The 2j-th and (2j+1)-th bit in the fourth sequence are determined based on the j-th bit in the sequence number sequence. The 2j-th and (2j+1)-th bit in the fourth sequence are the same, where j = 0, 1, 2, ..., M-1. Based on this implementation, a 2M-length sequence can be reasonably determined based on the fourth, fifth, and sixth sequences to ensure the detection performance of the first sequence. The fourth sequence is determined based on the sequence number sequence. Compared to schemes such as Frank sequence extension or sequence length extension based on PW sequence construction, the extended sequence has better error correction performance as a reliability sequence, lower extension complexity, and is easier to implement.

[0248] In this sequence, the bit indices in the fifth sequence are used to indicate bit indices. The bit indices in the fifth sequence are determined according to the reliability order. The fifth sequence is a reliability sequence of length M. For example, the fifth sequence could be a reliability sequence with values ​​of 0, 1, 2...M-1.

[0249] Additionally, the bit indices in the sixth sequence are used to indicate bit indices. The bit indices in the sixth sequence are determined according to the reliability order. The sixth sequence can be a reliability sequence of length M. For example, the sixth sequence can be another reliability sequence with values ​​of 0, 1, 2…M-1; if i=1, then the sixth sequence can be another reliability sequence with values ​​of 0, 1, 2…M-1.

[0250] Alternatively, it can be considered that the range of bit indices in the fifth sequence is the same as the range of bit indices in the sequence numbering sequence. Furthermore, the range of bit indices in the sixth sequence is the same as the range of bit indices in the sequence numbering sequence. The position of a bit in the fifth sequence can be the same as or different from its position in the sequence numbering sequence, and the position of a bit in the sixth sequence can also be the same as or different from its position in the sequence numbering sequence.

[0251] Optionally, the fifth and sixth sequences can be the same or different. As a simplified implementation, the fifth and / or sixth sequences in this application can be the same as the sequence number.

[0252] For example, the sequence number sequence in the above extension method can also be an NR Polar code sequence. When M=1024, the sequence number sequence and the sixth sequence can be NR Polar code sequences, and the fifth sequence can be other sequences; or, the sequence number sequence and the fifth sequence can be NR Polar code sequences, and the sixth sequence can be other sequences; or, the sequence number sequence, the fifth sequence, and the sixth sequence can all be NR Polar code sequences.

[0253] Furthermore, the sequence number in the above extension method can also be a non-NR Polar code sequence. For example, when M = 1024, the above sequence number can be a non-NR Polar code sequence, in which case the fifth sequence and / or the sixth sequence can be an NR Polar code sequence.

[0254] Understandably, compared to the case where the fifth sequence is the same as the sequence number and the sixth sequence is the same as the sequence number, when the fifth sequence and / or the sixth sequence is different from the sequence number, the method of extending the sequence number based on the fifth and sixth sequences is more flexible, and the error correction performance of the first sequence obtained from the extended 2M-long sequence is better. Furthermore, to reduce the storage overhead and complexity of the sequences, the fifth and / or sixth sequences can also be set as the sequence number sequences. Therefore, there is no need to additionally store or retrieve the fifth and / or sixth sequences; that is, in this case, the fifth sequence is the same as the sequence number and / or the sixth sequence is the same as the sequence number.

[0255] The following describes how to determine a 2M-long sequence based on the fourth, fifth, and sixth sequences.

[0256] In one method 1 for determining the fourth sequence, the j-th bit of the sequence number is used as the 2j-th bit and (2j+1)-th bit in the fourth sequence.

[0257] For example, the sequence number can be represented as [a,b,c……], where the M / 2 bits in the sequence number are a,b,c……. Similarly, the fourth sequence can be represented as [a,a,b,b,c,c……], where the M bits in the fourth sequence are a,a,b,b,c,c…….

[0258] Optionally, the sequence number can be Kronecker productd with [1 1] to obtain the fourth sequence.

[0259] Furthermore, the M bits in the fifth sequence can be filled into the positions of the bits in the fourth sequence that are less than M / 2, according to their order in the fifth sequence. Then, the M bits in the sixth sequence can be added to M and filled into the positions of the bits in the fourth sequence that are greater than or equal to M / 2, according to their order in the sixth sequence, to obtain a 2M-long sequence.

[0260] Taking M=4, the bit indices in the fifth sequence as [0,2,1,3], and the bit indices in the sixth sequence as [0,2,1,3], the indices in the sequence are represented as [0,2,1,3]. Performing the Kronecker product between the indices and [1 1] yields the fourth sequence [0,0,2,2,1,1,3,3]. The bits in the fourth sequence less than M / 2=2 are sequentially filled into the bit indices [0,2,1,3] of the fifth sequence, and the bits in the fourth sequence greater than or equal to M / 2=2 are sequentially filled into the bit indices [0,2,1,3] of the sixth sequence, adding the value of M=4 to each. That is, the bits in the fourth sequence greater than or equal to M / 2=2 are filled into [4,6,5,7]. The resulting sequence is the 2M-length sequence [0,2,4,6,1,3,5,7].

[0261] In another method 2 for determining the fourth sequence, the sequence number can be quantized into a binary sequence of length M, or in other words, the j-th bit in the sequence number is quantized and used as the j-th bit in the binary sequence. All bits in this binary sequence take either the first or second value, meaning the number of bit values ​​in the sequence is 2. In this method of determining the fourth sequence, the j-th bit in the binary sequence is used as the 2j-th and (2j+1)-th bit in the fourth sequence. Optionally, the 2j-th and (2j+1)-th bit in the second sequence are equal, and the 2j-th and (2j+1)-th bit in the second sequence are not equal to the j-th bit in the first sequence. Alternatively, the fourth sequence can be obtained by performing a Kronecker product between the binary sequence corresponding to the sequence number and [1 1].

[0262] For example, quantizing a sequence of numbers into a binary sequence of length can be achieved by quantizing all bits in the sequence with values ​​less than M / 2 to a first value, and quantizing all bits with values ​​greater than or equal to M / 2 to a second value. The first and second values ​​are not equal.

[0263] As an example rather than a limitation, the first value can be 0 and the second value can be 1. In addition, the first and second values ​​can also be other combinations, for example, the first value can be 1 and the second value can be 0, or the first value can be a value other than 0 or 1 and the second value can be another value, and so on, without further enumeration.

[0264] For example, taking M=1024 as an example, the first sequence is [0,512,1,513……], and the corresponding binary sequence can be represented as [A,B,A,B……], where A and B represent the first and second values, respectively. Correspondingly, the fourth sequence can be represented as [A,A,B,B,A,A,B,B,……].

[0265] In Method 2, after determining the fourth sequence, the M bits in the fifth sequence can be filled into the positions in the fourth sequence where the value is the first value, according to the order of the bit numbers in the fifth sequence. Then, the M bits in the sixth sequence are added to M and filled into the positions in the fourth sequence where the value is the second value, according to the order of the bit numbers in the sixth sequence, to obtain a 2M-long sequence.

[0266] Taking M=4, the bit indices in the fifth sequence as [0,2,1,3], and the bit indices in the sixth sequence as [0,2,1,3] as an example, the bit indices in the sequence are represented as [0,2,1,3], and the corresponding binary sequence is [A,B,A,B]. Performing the Kronecker product of this binary sequence with [1+1] yields the fourth sequence [A,A,B,B,A,A,B,B]. The positions of the first value A in the fourth sequence are sequentially filled into the positions of the bit indices [0,2,1,3] in the fifth sequence, and the positions of the second value B in the fourth sequence are sequentially filled into the positions of the bit indices [0,2,1,3] in the sixth sequence, each incremented by 2. p The value = 4 is filled in as [4, 6, 5, 7], and the resulting sequence is the 2M-long sequence [0, 2, 4, 6, 1, 3, 5, 7].

[0267] It is understandable that, in a formulaic expression, the fourth sequence Q... A 'Can satisfy:'

[0268] Q A '=kron(Q A , [1, 1]); (Formula 1)

[0269] Where kron() represents the Kronecker product. Where Q... A This represents the sequence number in method 1 for determining the fourth sequence, or the binary sequence in method 2 for determining the fourth sequence.

[0270] It is understood that Formula 1 is merely one way of describing the formula that the fourth sequence satisfies, and this application does not limit the fourth sequence to satisfy other formulas.

[0271] The method for obtaining the 2M-long sequence described above can also be described as follows: The first device obtains a fourth sequence, and then determines a 2M-long sequence based on the fourth sequence, a fifth sequence of length M, and a sixth sequence of length M. One or more of the fourth, fifth, and sixth sequences are obtained based on a sequence number. Introducing a fifth and / or sixth sequence that is different from the 2M-long sequence can improve the error correction performance of the extended first sequence.

[0272] Alternatively, the above method of obtaining a 2M-long sequence can also be described as follows: The 2M-long sequence is determined based on the fourth, fifth, and sixth sequences of length 2M. The length of the fifth and sixth sequences is M. The bit numbers in the fifth and sixth sequences are used to indicate bit indices. The bit numbers in the fifth and sixth sequences are determined according to reliability sorting. The 2j-th bit number and the (2j+1)-th bit number in the fourth sequence are determined based on the j-th bit number in the sequence number sequence. The 2j-th bit number and the (2j+1)-th bit number in the fourth sequence are the same, and j = 0, 1, 2...M-1.

[0273] Alternatively, the above method of obtaining a 2M-long sequence can also be described as follows: The 2M-long sequence includes a fifth sequence and a seventh sequence. The r-th bit in the seventh sequence is the sum of the r-th bit in the sixth sequence and M, where r = 0, 1, 2...M-1. The length of the fifth and sixth sequences is M. The bit indices in the fifth and sixth sequences are used to indicate bit indices, which are determined according to reliability order. The fifth sequence includes bit indices less than M in the 2M-long sequence. The bit indices of the sequence corresponding to the index of the fifth sequence in the 2M-long sequence divided by 2 and rounded down are less than M / 2. The seventh sequence includes bit indices greater than or equal to M in the 2M-long sequence. The bit indices of the sequence corresponding to the index of the seventh sequence in the 2M-long sequence divided by 2 and rounded down are greater than or equal to M.

[0274] Alternatively, the above method of obtaining a 2M-long sequence can also be described as follows: The 2M-long sequence includes a fifth sequence and a seventh sequence. The r-th bit in the seventh sequence is the sum of the r-th bit in the sixth sequence and M, where r = 0, 1, 2...M-1. The length of the fifth and sixth sequences is M. The bit indices in the fifth and sixth sequences are used to indicate bit indices. The bit indices in the fifth and sixth sequences are determined according to reliability order. The position of the j-th bit in the fifth sequence in the 2M-long sequence is the same as the position of the j-th bit less than M / 2 in the fourth sequence of length 2M, where j = 0, 1...M-1. The position of the r-th bit in the seventh sequence in the 2M-long sequence is the same as the position of the r-th bit greater than or equal to M / 2 in the fourth sequence, where r = 0, 1...M-1.

[0275] The above 2M-length sequence satisfies the following properties: it consists of N / 2 number groups of length 2, where any number group of length 2 includes the 2i-th bit and the (2i+1)-th bit from the N bit groups in the first sequence, i = 0, 1, 2...N / 2-1; the bit numbers in the x1-th number groups of the N / 2 number groups of length 2 are all less than N / 2; the bit numbers in the x2-th number groups of the N / 2 number groups of length 2 are all greater than or equal to N / 2; x1 and x2 are both integers greater than or equal to 0 and less than or equal to x; and (x1+x2) / x is greater than or equal to a third threshold. The third threshold is greater than 0 and less than 1. x1+x2 is less than or equal to N / 2.

[0276] (x1+x2) / (N / 2) represents the proportion of a 2M-long sequence where the 2i-th bit index and the (2i+1)-th bit index are both less than N / 2 or both greater than or equal to N / 2. In other words, the proportion of a 2M-long sequence where the 2i-th bit index and the (2i+1)-th bit index are both less than N / 2 or both greater than or equal to N / 2 is greater than or equal to a third threshold. Here, x1 represents the number of bits (i) that make both the 2i-th bit index and the (2i+1)-th bit index less than N / 2, and x2 represents the number of bits (i) that make both the 2i-th bit index and the (2i+1)-th bit index greater than or equal to N / 2.

[0277] Alternatively, (x1+x2) can be considered as the number of sequence groups in the first sequence that are related to the sequence sequences in the sequence group set. Therefore, it can also be said that the proportion of sequence groups in the first sequence that are related to the sequence sequences in the sequence group set is greater than or equal to the third threshold.

[0278] Alternatively, we can say that the N bit indices include the 2i-th bit and the (2i+1)-th bit, where i = 0, 1, 2, ..., N / 2-1, and at least y i satisfy the following: the 2i-th bit and the (2i+1)-th bit in the N bit indices are less than N / 2, or the 2i-th bit and the (2i+1)-th bit in the N bit indices are greater than or equal to N / 2; where y is a positive integer greater than or equal to 0 and less than or equal to N / 2, and y / (N / 2) is greater than or equal to the third threshold. We can also consider y = x1 + x2, that is, y equals the sum of the i quantities x1 that make both the 2i-th bit and the (2i+1)-th bit less than N / 2 and the i quantities x2 that make both the 2i-th bit and the (2i+1)-th bit greater than or equal to N / 2.

[0279] Optionally, (x1+x2) / (N / 2) or y / (N / 2) is positively correlated with N. That is, (x1+x2) / (N / 2) or y / (N / 2) increases as N increases and decreases as N decreases. Therefore, with longer code lengths, the proportion of bits in the first sequence that satisfy the condition that the 2i-th bit and the (2i+1)-th bit are both less than N / 2 or both are greater than or equal to N / 2 is larger, which can guarantee the communication performance of the sequence.

[0280] Alternatively, the third threshold can be considered positively correlated with N. For example, when N = 2048, the third threshold is no less than 70% or 75%. When N = 4096, the third threshold is no less than 85%.

[0281] As one possible scenario, (x1+x2) / (N / 2) or y / (N / 2) is 1. That is, any value of i can make the 2i-th bit and the (2i+1)-th bit in the N bit sequence less than N / 2, or make the 2i-th bit and the (2i+1)-th bit in the N bit sequence greater than or equal to N / 2. In this case, the sequence can be guaranteed to have good decoding performance.

[0282] Alternatively, it can be said that the first sequence or a portion of the first sequence satisfies the above characteristics. That is, the first sequence or a portion of the first sequence satisfies the following: it consists of N / 2 number groups of length 2, where any number group of length 2 includes the 2i-th bit and the (2i+1)-th bit from the N bit groups in the first sequence, i = 0, 1, 2...N / 2-1; the bit numbers in the x1 number groups of the N / 2 number groups of length 2 are all less than N / 2; the bit numbers in the x2 number groups of the N / 2 number groups of length 2 are all greater than or equal to N / 2; x1 and x2 are both integers greater than or equal to 0 and less than or equal to N / 2; and (x1+x2) / (N / 2) is greater than or equal to the third threshold. Optionally, (x1+x2) / (N / 2) is 1. x1+x2 is less than or equal to N / 2.

[0283] Furthermore, compared to Frank sequence extension or sequence length extension schemes based on polarization weighted sequence construction, the extended sequence exhibits better error correction performance when used as a reliable sequence, and has lower extension complexity and is easier to implement.

[0284] This application can also achieve sequence extension through Frank sequence extension or sequence length extension scheme based on polarization weight sequence construction scheme, etc., and the extended sequence can be used to obtain the first sequence.

[0285] The following describes how to implement polar coding of the information bit sequence based on the first sequence.

[0286] One possible implementation: The first device can determine the information bit index set according to the first sequence and the selection rule, place information bits in the information bit index set, and place frozen bits in the remaining positions to obtain the bit sequence before encoding (e.g., in the relevant description of Figure 3(a)). The bit sequence before encoding is polarized to obtain the bit sequence after encoding.

[0287] In one possible implementation, the selection rule could be to choose the indices of the K most reliable sub-channels as the information bit index set.

[0288] In another possible implementation, after removing the bit indices corresponding to rate matching from the first sequence, K highly reliable bit indices are selected from the remaining bit indices as the information bit index set. The bit indices corresponding to rate matching include the bit indices corresponding to shortening or puncturing, and optionally, also include pre-frozen bit indices.

[0289] It is understandable that the second device can perform polarization decoding on the same first sequence of symbols to be decoded. For example... Figure 6 As shown, the second device can perform decoding through the following steps:

[0290] S201: The second device acquires the sequence of symbols to be decoded.

[0291] The sequence of symbols to be decoded can be the decoding information obtained by the second device. The decoded symbol sequence corresponds to the polar-coded bit sequence.

[0292] In one implementation method, the second device acquires the sequence of symbols to be decoded by receiving physical signals over an air interface and obtaining the sequence by parsing the physical signals. Alternatively, the second device can acquire the sequence of symbols to be decoded locally through an internal interface. This acquisition can be obtained by parsing physical signals from other local devices, components, or modules. The aforementioned physical signals can carry the polar-coded bit sequence sent by the first device. The generation process of the polar-coded bit sequence can be referred to... Figure 4 The operation of the first device in the process is that the first device can generate a polar-coded bit sequence based on the information bit sequence.

[0293] In other words, as an example, the first device can send a physical signal to the second device, which carries the polar-coded bit sequence obtained in step S103. The second device receives the physical signal generated based on the polar-coded bit sequence, parses the physical signal, and obtains the sequence of symbols to be decoded. That is, the sequence of symbols to be decoded corresponds to the encoded bit sequence sent by the first device.

[0294] S202: The second device performs polarization decoding on the sequence of symbols to be decoded according to the first sequence, to obtain the polarized decoded bit sequence. The first sequence can be found in [reference needed]. Figure 4 The corresponding explanation in the process. The bit sequence after polarization decoding can be the information bit sequence recovered by the second device, which corresponds to the information bit sequence obtained by the first device in S101.

[0295] Specifically, the second device can use the first sequence as a reliability sequence for polarization decoding of the symbol sequence to be decoded. This application does not limit the specific method by which the second device performs polarization decoding. The decoded bit sequence obtained through polarization decoding can be the information bit sequence in S101.

[0296] For example, during the decoding process, the second device can determine the information bit index set based on the first sequence, and then determine the information bits and frozen bits based on the information bit index set. Further, methods such as SC, SCL, or belief propagation (BP) can be used to estimate the value of each information bit based on the matching symbols to be decoded, thus forming the information bit sequence. The method by which the second device determines the information bit index set based on the first sequence is similar to the method used by the first device to determine the information bit index set based on the first sequence during polar coding, and will not be repeated here.

[0297] Understandably, the second device can be referred to Figure 4 The method described in the first device for determining the first sequence is to determine the first sequence and decode it based on the first sequence.

[0298] Optionally, the first device may indicate the first sequence to the second device via signaling (such as RRC message, MAC CE, or DCI) after S101 and / or S102. Alternatively, the second device may refer to... Figure 4 The method for determining the first sequence is as follows: After determining the first sequence, the first sequence is indicated to the first device through signaling (such as RRC message, MAC CE or DCI).

[0299] In this embodiment, the reliability sequence contains N bit indices starting from 0 and ending at N-1 as an example. These N bit indices represent N bit indices. In practice, the N bit indices can also start from 1 and end at N; simply adding 1 to each bit in the above sequence will suffice, which is also the bit indices format used in the aforementioned calculation methods. Of course, other methods can also be used to represent the bit indices or identifiers; this specific representation does not affect the specific location of the sub-channel represented in the sequence.

[0300] It should be noted that the sequences or methods of determining sequences shown in this application are merely examples, and their application in the Polar encoding process can help improve the encoding and decoding performance of Polar codes, such as supporting longer Polar codes. In any of the example sequences, adjustments or equivalent substitutions can be made, including but not limited to the following, without affecting the overall effect:

[0301] 1. Swapping the positions of a few bits in a sequence. For example, the position of a bit can be adjusted within a set range. For instance, if the set range is 5, the position of bit number 10 can be adjusted within 5 positions to the left or right.

[0302] 2. Some bit sequence values ​​in the sequence are adjusted, but the set of channels selected based on the sequence for transmitting information bit sequences is consistent or similar.

[0303] 3. The sequence contains N bit indices starting from 0 and ending at N-1. These N bit indices represent N bit numbers. In practice, the N bit indices can also start from 1 and end at N; simply add 1 to each bit in the above sequence. This is the bit indices format used in the calculation methods described above. Of course, other methods can also be used to represent these bit indices or identifiers; the specific representation does not affect the specific location of the sub-channel represented in the sequence. The bit indices can be the position numbers or position indices of the bits to be encoded.

[0304] 4. The N bits in the above sequence are arranged in ascending order of reliability. Selecting K bits from high to low reliability gives the sub-channel corresponding to the last K bits of any of the above sequences. In fact, the N bits can also be arranged in descending order of reliability by reversing or unreversing the order of the bits in the above sequence. In this case, selecting K bits from high to low reliability gives the sub-channel corresponding to the first K bits.

[0305] 5. The above sequence can also be characterized using the normalized reliability or equivalent reliability sequence of each channel. For example, if a channel is in the order n of the above sequence (the leftmost one is denoted as 1), then the reliability of the channel can be expressed as n or normalized n / N, where N is the length of the sequence.

[0306] In the embodiments of this application, "transmission" includes "output" and / or "input". "Output" and "input" represent the direction of signal transmission. For example, "outputting information to XX" can be understood as the destination of the information being XX, which may include directly sending information via an air interface or other interface, or indirectly sending information from other units or modules. "Inputting information from YY" can be understood as the source of the information being YY, which may include directly receiving information from YY via an air interface or other interface, or indirectly inputting information from YY from other units or modules. "Output" can also be understood as "sending" through a chip interface, and "input" can also be understood as "receiving" through a chip interface. In other words, output and input can occur between devices, for example, between an access network node and a terminal. Output and input can also occur within a device, for example, sending or receiving information between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.

[0307] It is understood that the first device mentioned above can be a terminal, a chip (or other component) in the terminal, and the second device can be a base station or a chip (or other component (such as CU, DU, or RU) in the base station). Alternatively, the second device can be a terminal, a chip (or other component) in the terminal, and the first device can be a base station or a chip (or other component (such as CU, DU, or RU) in the base station).

[0308] It is understood that, in order to achieve the functions in the above embodiments, the terminal device or network device includes hardware structures and / or software modules corresponding to perform each function. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in the form of hardware, computer software, or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0309] Figure 7 and Figure 8 The diagram illustrates the possible structures of communication devices provided in the embodiments of this application. These communication devices can be used to implement the functions of the first or second device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the communication device can be a terminal device or a network device, or it can be a module (such as a chip) applied to a terminal device or a network device.

[0310] Figure 7 The communication device 700 shown includes a processing unit 710 and a transceiver unit 720. The communication device 700 is used to implement the functions of the first or second device in the above method embodiments. For example, the functions of the first device can be found in [reference needed]. Figure 4 For a description of the relevant content, please refer to the description of the function of the second device. Figure 6 Description of the relevant content.

[0311] When the communication device 700 is used to implement the function of the first device in the above method embodiment, the processing unit 710 and / or the transceiver unit 720 can be used to acquire the information bit sequence, and the processing unit 710 and / or the transceiver unit 720 can be used to perform polar coding on the information bit sequence according to a first sequence of length N to obtain the polar-coded bit sequence. The transceiver unit 720 can also be used to output the polar-coded bit sequence.

[0312] When the communication device 700 is used to implement the function of the second device in the above method embodiment, the processing unit 710 and / or the transceiver unit 720 can be used to obtain the sequence of symbols to be decoded, and the processing unit 710 and / or the transceiver unit 720 can be used to perform polarization decoding on the sequence of symbols to be decoded according to the first sequence to obtain the polarized decoded bit sequence.

[0313] For a more detailed description of the processing unit 710 and the transceiver unit 720, please refer directly to the relevant descriptions in the above method embodiments, which will not be repeated here.

[0314] Figure 8 The communication device 800 shown includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It is understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication device 800 may also include a memory 830 for storing instructions executed by the processor 810, or storing input data required by the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions.

[0315] When the communication device 800 is used to implement the above method embodiment, the processor 810 is used to implement the function of the processing unit 710, and the interface circuit 820 is used to implement the function of the transceiver unit 720.

[0316] It is understood that the processor in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), microprocessors without interlocked piped stages architecture (MIPS), advanced instruction set computers (RISC) machines (ARM), network processors (NPs), field-programmable gate arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.

[0317] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Furthermore, the ASIC can reside in a first device or a second device. Alternatively, the processor and storage medium can exist as discrete components in the first device or the second device.

[0318] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program is a set of instructions that instruct an electronic computer or other device having a first or second device to perform any step of its operation. It is typically written in a programming language and runs on a target architecture. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be volatile or non-volatile, or it can include both types of storage media.

[0319] Based on the same technical concept, embodiments of this application also provide a computer-readable storage medium, including a program or instructions, which, when run on a computer, cause the methods in the above method embodiments to be executed.

[0320] Based on the same technical concept, embodiments of this application also provide a computer program product, including instructions that, when run on a computer, cause the methods in the above method embodiments to be executed.

[0321] Based on the same technical concept, embodiments of this application also provide a communication system, which may include a first device and a second device. In this communication system, the first device and the second device may be respectively used to implement… Figure 4 and Figure 6 The method flow is described in the text. As an example, the first device can be a terminal, and the second device can be a network device (such as a base station). As another example, the first device can be a network device, and the second device can be a terminal.

[0322] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can 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.) containing computer-usable program code.

[0323] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions between different embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0324] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates an "or" relationship between the preceding and following related objects; in the formulas of this application, the character " / " indicates a "division" relationship between the preceding and following related objects.

[0325] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

Claims

1. A communication method, characterized in that, include: Obtain the information bit sequence; The information bit sequence is polar-coded according to a first sequence of length N to obtain a polar-coded bit sequence, wherein... The first sequence includes N bit indices, which are ordered according to their reliability. The q-th bit among the M first bit indices of the N bit indices is equal to the sum of the q-th bit in the second sequence of length M and k1*M. q = 0, 1, 2...M-1, k1 is an integer greater than or equal to 0, and N is 2048, 4096 or 8192; Output the polarized encoded bit sequence.

2. A communication method, characterized in that, include: Obtain the sequence of symbols to be decoded; The sequence of symbols to be decoded is polarized decoded according to a first sequence of length N to obtain a polarized decoded bit sequence. The first sequence includes N bit indices, which are sorted according to their reliability. The q-th bit in the M first bit indices of the N bit indices is equal to the sum of the q-th bit in the second sequence of length M and k1*M, where q = 0, 1, 2...M-1, k1 is an integer greater than or equal to 0, and N is 2048, 4096, or 8192.

3. The method as described in claim 1 or 2, characterized in that, The N bit indices include bit indices from p number groups of length M. The p1 number groups of length M satisfy the following condition: the q-th bit in the p1 number group is equal to the q-th bit in the second sequence; or, the q-th bit in the p1 number group is equal to the sum of the q-th bit in the second sequence and a positive integer multiple of M. p is a positive integer greater than 1, and p1 is a positive integer greater than 1 and less than or equal to p; Where p1 / p is greater than or equal to the first threshold.

4. The method according to any one of claims 1-3, characterized in that, The q-th bit in the M second bits of the N bit sequence is equal to the sum of the q-th bit in the third sequence of length M and k2*M, where k2 is an integer greater than or equal to 0.

5. The method as described in claim 4, characterized in that, The N bit indices include the bit indices in p number groups of length M. The p2 number groups of the p number groups of length M satisfy the following: the q-th bit in the number group is equal to the q-th bit in the third sequence, or the q-th bit in the number group is equal to the sum of the q-th bit in the third sequence and a positive integer multiple of M, where p is a positive integer greater than 1 and p2 is a positive integer greater than 1 and less than p. Where p2 / p is less than or equal to the second threshold.

6. The method according to any one of claims 1-5, characterized in that, The N bit indices include the 2i-th bit indices and the (2i+1)-th bit indices, i = 0, 1, 2...N / 2-1, and at least y i satisfy: the 2i-th bit indices and the (2i+1)-th bit indices of the N bit indices are less than N / 2, or the 2i-th bit indices and the (2i+1)-th bit indices of the N bit indices are greater than or equal to N / 2; where y is a positive integer greater than or equal to 0 and less than or equal to N / 2, and y / (N / 2) is greater than or equal to a third threshold.

7. The method as described in claim 6, characterized in that, The third threshold is positively correlated with N.

8. The method according to any one of claims 1-7, characterized in that, The first sequence satisfies the following characteristics: For i = 0, 1, 2...N / 2-1, the 2ith bit index and the (2i+1)th bit index are less than N / 2, or the 2ith bit index and the (2i+1)th bit index are greater than or equal to N / 2.

9. The method according to any one of claims 1-2 and 4-8, characterized in that, M = 8, and the second sequence includes at least one of the following: 0 1 2 3 5 4 6 7； 0 2 1 4 3 5 6 7； 0 1 2 4 3 6 5 7； 0 1 2 4 6 3 5 7； 0 1 2 4 5 3 7 6； M = 16, and the second sequence includes at least one of the following: 0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15； 0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15； 0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15； 0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15； M = 1024, the second sequence is: [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7 12966 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22 136260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192 544 7044 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84 138 145261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 148 46 75 266273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112 135 78 289194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101 147 176 142530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 92 47 267 385546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269 108 578 224166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87 197 116 17061 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201 336 62 282143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284 648 94 204298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115 167 225 326306 772 157 656 329 110 117 212 171 776 330 226 549 538 387 308 216 416 271279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179 228 338 312704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527 582 556 181295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396 344 586 645593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832 588 186 646404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449 217 408 609596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218 368 652 230391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314 424 395 673583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452 397 403 207674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398 346 456 358405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419 406 464 680801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792 802 611 602410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613 422 425 451614 543 235 412 343 372 775 317 222 426 453 237 559 833 804 712 834 661 808779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898 781 376 428665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245 458 666 620363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790 460 249 682573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481 574 413 603366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713 632 482 806427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716 864 810 606912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378 459 622 627437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462 442 441 469247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685 844 633 711253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473 634 744 852960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811 379 697 431607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868 819 814 439929 490 623 671 739 916 463 843 381 497 930 821 726 961 872 492 631 729 700443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687 903 825 500846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828 753 854 857504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858 478 968 383910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922 874 918 502933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882 937 963 747505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830 911 871 639888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923 972 761 877952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980 926 764 941967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000 892 950 863759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887 985 997 986943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 1004 1010 957 983958 987 1012 999 1016 767 989 1003 990 1005 959 1011 1013 8951006 1014 10171018 991 1020 1007 1015 1019 1021 1022 1023]。 10. The method as described in claim 3, characterized in that, M=8, the second sequence is: 0 1 2 3 5 4 6 7； M=16, the second sequence is: 0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15； M = 1024, the second sequence is: [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7 12966 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22 136260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192 544 7044 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84 138 145261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 148 46 75 266273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112 135 78 289194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101 147 176 142530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 92 47 267 385546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269 108 578 224166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87 197 116 17061 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201 336 62 282143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284 648 94 204298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115 167 225 326306 772 157 656 329 110 117 212 171 776 330 226 549 538 387 308 216 416 271279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179 228 338 312704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527 582 556 181295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396 344 586 645593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832 588 186 646404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449 217 408 609596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218 368 652 230391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314 424 395 673583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452 397 403 207674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398 346 456 358405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419 406 464 680801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792 802 611 602410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613 422 425 451614 543 235 412 343 372 775 317 222 426 453 237 559 833 804 712 834 661 808779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898 781 376 428665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245 458 666 620363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790 460 249 682573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481 574 413 603366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713 632 482 806427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716 864 810 606912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378 459 622 627437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462 442 441 469247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685 844 633 711253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473 634 744 852960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811 379 697 431607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868 819 814 439929 490 623 671 739 916 463 843 381 497 930 821 726 961 872 492 631 729 700443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687 903 825 500846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828 753 854 857504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858 478 968 383910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922 874 918 502933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882 937 963 747505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830 911 871 639888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923 972 761 877952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980 926 764 941967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000 892 950 863759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887 985 997 986943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 1004 1010 957 983958 987 1012 999 1016 767 989 1003 990 1005 959 1011 1013 8951006 1014 10171018 991 1020 1007 1015 1019 1021 1022 1023]。 11. The method as described in claim 4, characterized in that, M=8, and the third sequence includes at least one of the following: 0 1 2 3 5 4 6 7； 0 2 1 4 3 5 6 7； 0 1 2 4 3 6 5 7； 0 1 2 4 6 3 5 7； 0 1 2 4 5 3 7 6； M = 16, and the third sequence includes at least one of the following: 0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15； 0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15； 0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15； 0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15； M = 1024, and the third sequence is: [0 1 2 4 8 16 32 3 5 64 9 6 17 10 18 128 12 33 65 20 256 34 24 36 7 12966 512 11 40 68 130 19 13 48 14 72257 21 132 35 258 26 513 80 37 25 22 136260 264 38 514 96 67 41 144 28 69 42 516 49 74 272 160 520 288 528 192 544 7044 131 81 50 73 15 320 133 52 23 134 384 76 137 82 56 27 97 39 259 84 138 145261 29 43 98 515 88 140 30 146 71 262 265 161 576 45 100 640 51 148 46 75 266273 517 104 162 53 193 152 77 164 768 268 274 518 54 83 57 521 112 135 78 289194 85 276 522 58 168 139 99 86 60 280 89 290 529 524 196 141 101 147 176 142530 321 31 200 90 545 292 322 532 263 149 102 105 304 296 163 92 47 267 385546 324 208 386 150 153 165 106 55 328 536 577 548 113 154 79 269 108 578 224166 519 552 195 270 641 523 275 580 291 59 169 560 114 277 156 87 197 116 17061 531 525 642 281 278 526 177 293 388 91 584 769 198 172 120 201 336 62 282143 103 178 294 93 644 202 592 323 392 297 770 107 180 151 209 284 648 94 204298 400 608 352 325 533 155 210 305 547 300 109 184 534 537 115 167 225 326306 772 157 656 329 110 117 212 171 776 330 226 549 538 387 308 216 416 271279 158 337 550 672 118 332 579 540 389 173 121 553 199 784 179 228 338 312704 390 174 554 581 393 283 122 448 353 561 203 63 340 394 527 582 556 181295 285 232 124 205 182 643 562 286 585 299 354 211 401 185 396 344 586 645593 535 240 206 95 327 564 800 402 356 307 301 417 213 568 832 588 186 646404 227 896 594 418 302 649 771 360 539 111 331 214 309 188 449 217 408 609596 551 650 229 159 420 310 541 773 610 657 333 119 600 339 218 368 652 230391 313 450 542 334 233 555 774 175 123 658 612 341 777 220 314 424 395 673583 355 287 183 234 125 557 660 616 342 316 241 778 563 345 452 397 403 207674 558 785 432 357 187 236 664 624 587 780 705 126 242 565 398 346 456 358405 303 569 244 595 189 566 676 361 706 589 215 786 647 348 419 406 464 680801 362 590 409 570 788 597 572 219 311 708 598 601 651 421 792 802 611 602410 231 688 653 248 369 190 364 654 659 335 480 315 221 370 613 422 425 451614 543 235 412 343 372 775 317 222 426 453 237 559 833 804 712 834 661 808779 617 604 433 720 816 836 347 897 243 662 454 318 675 618 898 781 376 428665 736 567 840 625 238 359 457 399 787 591 678 434 677 349 245 458 666 620363 127 191 782 407 436 626 571 465 681 246 707 350 599 668 790 460 249 682573 411 803 789 709 365 440 628 689 374 423 466 793 250 371 481 574 413 603366 468 655 900 805 615 684 710 429 794 252 373 605 848 690 713 632 482 806427 904 414 223 663 692 835 619 472 455 796 809 714 721 837 716 864 810 606912 722 696 377 435 817 319 621 812 484 430 838 667 488 239 378 459 622 627437 380 818 461 496 669 679 724 841 629 351 467 438 737 251 462 442 441 469247 683 842 738 899 670 783 849 820 728 928 791 367 901 630 685 844 633 711253 691 824 902 686 740 850 375 444 470 483 415 485 905 795 473 634 744 852960 865 693 797 906 715 807 474 636 694 254 717 575 913 798 811 379 697 431607 489 866 723 486 908 718 813 476 856 839 725 698 914 752 868 819 814 439929 490 623 671 739 916 463 843 381 497 930 821 726 961 872 492 631 729 700443 741 845 920 382 822 851 730 498 880 742 445 471 635 932 687 903 825 500846 745 826 732 446 962 936 475 853 867 637 907 487 695 746 828 753 854 857504 799 255 964 909 719 477 915 638 748 944 869 491 699 754 858 478 968 383910 815 976 870 917 727 493 873 701 931 756 860 499 731 823 922 874 918 502933 743 760 881 494 702 921 501 876 847 992 447 733 827 934 882 937 963 747505 855 924 734 829 965 938 884 506 749 945 966 755 859 940 830 911 871 639888 479 946 750 969 508 861 757 970 919 875 862 758 948 977 923 972 761 877952 495 703 935 978 883 762 503 925 878 735 993 885 939 994 980 926 764 941967 886 831 947 507 889 984 751 942 996 971 890 509 949 973 1000 892 950 863759 1008 510 979 953 763 974 954 879 981 982 927 995 765 956 887 985 997 986943 891 998 766 511 988 1001 951 1002 893 975 894 1009 955 1004 1010 957 983958 987 1012 999 1016 767 989 1003 990 1005 959 1011 1013 8951006 1014 10171018 991 1020 1007 1015 1019 1021 1022 1023]。 12. The method as described in claim 5, characterized in that, M=8, and the third sequence includes at least one of the following: 0 2 1 4 3 5 6 7； 0 1 2 4 3 6 5 7； 0 1 2 4 6 3 5 7； 0 1 2 4 5 3 7 6； M = 16, and the third sequence includes at least one of the following: 0 1 2 4 8 3 5 9 6 10 12 7 11 13 14 15； 0 1 2 4 8 3 6 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 9 6 12 7 11 13 14 15； 0 1 2 4 8 3 5 10 6 9 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 11 7 13 14 15； 0 1 2 4 8 6 3 5 9 10 12 7 11 13 14 15； 0 1 2 4 8 3 5 6 9 10 12 7 13 11 14 15； 0 1 2 4 8 3 5 6 10 9 12 7 11 13 14 15。 13. A communication device, characterized in that, Includes a processor for executing computer programs or instructions to implement the method as described in any one of claims 1-12.

14. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, and when the computer program or instructions are executed by a communication device, the method as described in any one of claims 1-12 is implemented.

15. A computer program product, characterized in that, When the computer program product is executed by a computer, the computer performs the method as described in any one of claims 1-12.

Images