Encoding method, decoding method, and communication device

CN123019750APending Publication Date: 2026-10-30HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510574721.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-04-30
Publication Date
2026-10-30

Smart Images

  • Figure CN123019750A_ABST
    Figure CN123019750A_ABST
Patent Text Reader

Abstract

The application relates to a coding method, a decoding method and a communication device, and relates to the technical field of communication, and can reduce the implementation complexity of polar coding and polar decoding. The method comprises the following steps: mapping an information bit sequence with a length of K to a to-be-coded bit sequence with a length of N according to a first reliability sequence with a length of N, performing polar coding on the to-be-coded bit sequence to obtain a coded bit sequence with a length of N, and outputting the coded bit sequence. Wherein, any second sequence with a length of X in the first reliability sequence comprises at least one group of position index pairs (A, B), A and B respectively represent the A-th position index and the B-th position index of the second sequence; the reliability of the A-th position index is greater than the reliability of the B-th position index; the i-th second sequence comprises the (i*X)-th position index to the (i+1)*X-1-th position index in the first reliability sequence, i=0, 1,..., N / X-1, X is less than or equal to N, N and X are both integral powers of 2, and K is a positive integer.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to an encoding method, a decoding method, and a communication device. Background Technology

[0002] Channel coding, as a fundamental wireless access technology, plays a crucial role in ensuring reliable data transmission. Among them, polar codes are theoretically proven to achieve Shannon capacity and have relatively simple encoding and decoding complexity, thus gaining increasingly widespread application.

[0003] In a communication system, when polar coding is used, the transmitting device can polar code the information bit sequence according to the reliability sequence to obtain the encoded bit sequence and send it to the receiving device. Correspondingly, the receiving device performs polar decoding based on the reliability sequence.

[0004] Determining the reliability sequence to reduce the implementation complexity of polar coding and polar decoding is a problem to be studied. Summary of the Invention

[0005] This application provides an encoding method, a decoding method, and a communication device, which can provide a method for constructing polar coding and reduce the implementation complexity of polar coding and polar decoding.

[0006] Firstly, this application provides an encoding method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to a transmitting equipment, a component applied within the transmitting equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting equipment. The component applied within the transmitting equipment can be a component within the transmitting equipment itself, or a component external to the transmitting equipment and coupled to it. The method includes: mapping an information bit sequence of length K to a bit sequence to be encoded of length N based on a first reliability sequence of length N; performing polar encoding on the bit sequence to be encoded to obtain an encoded bit sequence of length N; and outputting the encoded bit sequence. Wherein, the first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indexes (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B; the reliability of the A-th position index is greater than the reliability of the B-th position index, and the i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, i = 0, 1, ..., N / X-1, X is less than or equal to N, N and X are both integer powers of 2, and K is a positive integer.

[0007] Secondly, this application provides a decoding method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to a receiving end device, a component applied within the receiving end device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving end device. The component applied within the receiving end device can be a component within the receiving end device itself, or a component external to the receiving end device but coupled to it. The method includes: receiving information to be decoded; performing polarization decoding on the information to be decoded according to a first reliability sequence; and obtaining a decoding result. Wherein, the length of the encoded bit sequence corresponding to the information to be decoded is N, where N is an integer power of 2. The first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indexes (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B; the reliability of the A-th position index is greater than the reliability of the B-th position index, and the i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, where i = 0, 1, ..., N / X-1, X is less than or equal to N, and X is an integer power of 2.

[0008] Based on the first or second aspect mentioned above, if the reliability of the A-th position index in at least one pair of position indexes (A, B) of the first position set is greater than the reliability of the B-th position index, the number of second sequences including the first position set increases, which can reduce the number of sorting types of the reliability of the subsequences (i.e., the second sequences) of the first reliability sequence, thereby reducing the implementation complexity of polar coding and polar decoding.

[0009] In conjunction with the first or second aspect, in one possible design, at least one set of position index pairs (A, B) includes at least one set of the following position index pairs: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (8,0), (9,0), (10,0), (11,0), (12,0), (13,0), (14,0), (15,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (8,1), (9,1), (10,1) 、(11,1),(12,1),(13,1),(14,1),(15,1),(3,2),(4,2),(5,2),(6,2),(7,2),(8,2),(9,2),(10,2),(11,2),(12,2),(13,2),(14,2),(15,2),(5,3),(6,3),(7,3),(9,3),(10,3),(11,3),(12,3),(13,3),(14,3),(15,3),(5,4),(6,4),( 7,4), (8,4), (9,4), (10,4), (11,4), (12,4), (13,4), (14,4), (15,4), (6,5), (7,5), (9,5), (10,5), (11,5), (12,5), (13,5), (14,5), (15,5), (7,6), (10,6), (11,6), (12,6), (13,6), (14,6), (15,6), (11,7), (13,7), (14,7), (15,7), (9,8) ), (10, 8), (11, 8), (12, 8), (13, 8), (14, 8), (15, 8), (10, 9), (11, 9), (12, 9), (13, 9), (14, 9), (15, 9), (11, 10), (12, 10), (13, 10), (14, 10), (15, 10), (13, 11), (14, 11), (15, 11), (13, 12), (14, 12), (15, 12), (14, 13), (15, 13), or (15, 14).

[0010] Based on this possible design, increasing the number of second sequences including the first position set can reduce the number of sorting types of the reliability of the subsequences (i.e., the second sequences) of the first reliability sequence, thereby reducing the implementation complexity of polar coding and polar decoding.

[0011] Combining the first or second aspect, in one possible design, the length of the second sequence is 8, and the number of sorting types for the reliability of the position indices in the I third sequences corresponding to the I second sequences is 1; or, the length of the second sequence is 16, and the number of sorting types for the reliability of the position indices in the I third sequences corresponding to the I second sequences is less than or equal to 2; or, the length of the second sequence is 32, and the number of sorting types for the reliability of the position indices in the I third sequences corresponding to the I second sequences is less than or equal to 11. Where I equals N / X, the m-th position index of the i-th third sequence is the difference between the m-th position index of the i-th second sequence and a first value, where the first value is i*X, and m = 0, 1, ..., X-1.

[0012] Based on this possible design, when the length of the subsequence is 8, the number of subsequence types of the first reliability sequence is 1. Compared with the reliability sequence, which has more types of subsequences, the first reliability sequence provided in this application embodiment can reduce the number of subsequence types and reduce implementation complexity.

[0013] Alternatively, when the length of the subsequence is 16, the number of types of the subsequence of the first reliability sequence is less than or equal to 2. Compared with the reliability sequence, which has more types of subsequences, the first reliability sequence provided in this application embodiment can reduce the number of types of subsequences and reduce the implementation complexity.

[0014] Alternatively, when the length of the subsequence is 32, the number of subsequence types of the first reliability sequence is less than or equal to 11. Compared with the reliability sequence, which has more types of subsequences, the first reliability sequence provided in this application embodiment can reduce the number of subsequence types and reduce implementation complexity.

[0015] Combining the first or second aspect, in one possible design, the sorting type of the reliability of the position indices included in the I third sequences is: 0, 1, 2, 4, 3, 5, 6, 7.

[0016] In conjunction with the first or second aspect, in one possible design, the ordering type of the reliability of the position indices included in the I third sequences includes one or more of the following: 0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15; or 0,1,2,4,8,3,5,9,6,10,12,7,11,13,14,15.

[0017] In conjunction with the first or second aspect, in one possible design, the ordering type of the reliability of the position indices included in the I third sequences includes one or more of the following:

[0018] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or,

[0019] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or,

[0020] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,21,14,22,25,26,28,15,23,27,29,30,31; or,

[0021] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or,

[0022] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,25,22,26,28,15,23,27,29,30,31; or,

[0023] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or,

[0024] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,25,22,26,28,15,23,27,29,30,31; or,

[0025] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,19,13,14,21,22,25,26,28,15,23,27,29,30,31; or,

[0026] 0,1,2,4,8,16,3,5,9,6,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or,

[0027] 0,1,2,4,8,16,3,5,9,6,17,10,18,12,20,24,7,11,19,13,14,21,25,22,26,28,15,23,27,29,30,31; or

[0028] 0,1,2,4,8,16,3,5,6,9,17,10,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31.

[0029] Based on the three possible designs described above, when the subsequence type has a length of 16, positions 0 to 7 have the same type as the subsequence of length 8. After converting positions 8 to 15 into 0 to 7, the order of these 0 to 7 is the same as the type of the subsequence of length 8. When the subsequence type has a length of 32, positions 0 to 15 have the same type as the subsequence of length 16. After converting positions 16 to 31 into 0 to 15, the order of these 0 to 15 is the same as the type of the subsequence of length 16. This can reduce the implementation complexity of polar coding and polar decoding.

[0030] In conjunction with the first or second aspect, in one possible design, the length of the first reliability sequence is any of the following: 1024, 2048, or 4096.

[0031] Based on this possible design, longer Polar code construction can be supported, increasing the design space for reliability sequences.

[0032] Combining the first or second aspect, in one possible design, the first reliability sequence is:

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

[0034] Combining the first or second aspect, in one possible design, the first reliability sequence is:

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

[0036] Thirdly, this application provides a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be a transmitting end device, a chip or chip system of a transmitting end device, or a system-on-a-chip, etc. The communication device can execute the functions performed by the transmitting end device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0037] For example, the processing module is used to map an information bit sequence of length K to a bit sequence to be encoded of length N according to a first reliability sequence of length N, and to perform polar coding on the bit sequence to be encoded to obtain an encoded bit sequence of length N; the transceiver module is used to output the encoded bit sequence. Wherein, the first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indices (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B; the reliability of the A-th position index is greater than the reliability of the B-th position index, and the i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, i = 0, 1, ..., N / X-1, X is less than or equal to N, N and X are both integer powers of 2, and K is a positive integer.

[0038] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0039] Fourthly, this application provides a communication device that can be applied to the receiving device described in the second aspect to realize the functions performed by the receiving device. The communication device can be a receiving device, a chip or chip system of a receiving device, or a system-on-a-chip, etc. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0040] For example, the transceiver module is used to receive the information to be decoded; the processing module is used to perform polarization decoding on the information to be decoded according to the first reliability sequence to obtain the decoding result. Here, the length of the encoded bit sequence corresponding to the information to be decoded is N, where N is an integer power of 2. The first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indices (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B. The reliability of the A-th position index is greater than the reliability of the B-th position index. The i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, i = 0, 1, ..., N / X-1, where X is less than or equal to N and X is an integer power of 2.

[0041] Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in any possible design of the second aspect described above, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0042] Fifthly, this application provides a communication device comprising one or more processors; the one or more processors being configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the encoding or decoding method described in any one of the first to second aspects is executed.

[0043] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0044] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0045] In a sixth aspect, this application provides a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used for inputting and / or outputting information; the logic circuit is used for executing the encoding or decoding method as described in any one of the first to second aspects, processing and / or generating information based on the information.

[0046] In a seventh aspect, this application provides a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the encoding or decoding methods described in any one of the first to second aspects to be performed.

[0047] Eighthly, this application provides a computer program product containing computer instructions that, when run on a computer, causes the encoding or decoding method as described in any one of the first to second aspects to be executed.

[0048] Ninthly, this application provides a computer program that, when run on a computer, causes the encoding or decoding method as described in any one of the first to second aspects to be executed.

[0049] In a tenth aspect, this application provides a chip comprising: a processor coupled to a memory for storing programs or instructions, wherein when the programs or instructions are executed by the processor, an encoding method or decoding method as described in any one of the first to second aspects is executed.

[0050] The technical effects of any of the design methods in aspects five through ten are similar to those in aspects one through two, and will not be elaborated upon further.

[0051] In one aspect, this application provides a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description

[0052] Figure 1 A schematic diagram of Polar encoding provided for an embodiment of this application;

[0053] Figure 2 A schematic diagram of a communication system provided in an embodiment of this application;

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

[0055] Figure 4 A structural diagram of a communication device provided in an embodiment of this application;

[0056] Figure 5 A flowchart illustrating an encoding and decoding method provided in this application embodiment;

[0057] Figure 6 A schematic diagram of a transmitting end device provided in an embodiment of this application;

[0058] Figure 7 A schematic diagram of a receiving device provided in an embodiment of this application;

[0059] Figure 8 A schematic diagram of a communication device provided in an embodiment of this application;

[0060] Figure 9 This is a schematic diagram of a communication device provided in an embodiment of this application. Detailed Implementation

[0061] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0062] Polar codes are the first channel coding method that can be rigorously proven to "achieve" channel capacity. At different code lengths, especially for finite-length codes, Polar codes outperform Turbo codes and low-density parity-check codes (LDPC). Furthermore, Polar codes have lower computational complexity in encoding and decoding. These advantages have led to the widespread use of Polar codes in fifth-generation (5G) mobile communication systems.

[0063] Polar codes are linear block codes with a generator matrix of G. N The encoding process is as follows in, It is a binary row vector with a length of N (i.e., code length). G N It is an N×N matrix, and n = log2(N); Defined as the Kronecker product of n matrices F2.

[0064] During the encoding process of Polar codes, A portion of the bits in a Polar code is used to carry information, called information bits, and the location of these information bits is called the information bit position; the other portion of the bits is set to fixed values ​​pre-agreed upon by the transmitting and receiving ends, called fixed bits, and the location of these fixed bits is called the fixed bit position. The encoding process of a Polar code can be described as follows: Figure 1 The fence diagram shown indicates that... Place it on the far left of the fence diagram, and perform n-order butterfly operations sequentially from left to right to obtain the encoding result.

[0065] A key problem in constructing Polar codes is determining the set of information bit positions. In early theoretical research, the set of information bit positions was typically selected using methods such as density evolution or Gaussian analysis to obtain the polarization channel error probability corresponding to the bit at position i. choose The K positions with the smallest values ​​constitute the information bit position set. This method requires calculating the specific values ​​for different channel conditions. In other words, it is a channel-dependent approach, which is difficult to implement in practice due to the variability of channels in real-world scenarios.

[0066] Further research shows that Polar codes can be constructed using a reliability sequence. When constructing a Polar code, the set of information bit positions can be determined by reading the corresponding reliability sequence. Specifically, this reliability sequence uses polarization channel indices to represent the order in which information bit positions are selected. For example, when the code length is 8, the reliability sequence can be [0 1 2 4 3 5 6 7], ordered according to the order of selection. When constructing an information bit set of length K, K sub-channels are read from back to front as the information bit position set. For example, when K = 2, the information bit position set read from back to front is [6,7]; when K = 4, the information bit position set is [3,5,6,7]. This sequence storage method is easier to implement, and it is also adopted in the 5G standard.

[0067] Thanks to its good performance and low complexity, Polar codes have been selected as the channel coding scheme for the control channel in the 5G standard. In practical implementation, the communication standard can pre-store a reliability sequence of length 1024, as shown in Table 1 below, for constructing Polar codes. Indicates reliability. This represents the location index corresponding to the reliability level. The higher the reliability value, the more reliable the location index.

[0068] Table 1

[0069]

[0070]

[0071]

[0072]

[0073] It is understandable that Table 1 above is defined starting from 0, but it can also be defined starting from 1. That is, the above 0, 1, ..., 1023 can be replaced with 1, 2, ..., 1024 without restriction.

[0074] When the transmitting and receiving devices encode and decode based on the reliability sequence shown in Table 1 above, there is room for further reduction in the implementation complexity of polar coding and polar decoding of the communication system.

[0075] Based on this, embodiments of this application provide an encoding method. In this method, the transmitting device maps an information bit sequence of length K to a bit sequence to be encoded of length N according to a first reliability sequence of length N, performs polar encoding on the bit sequence to be encoded to obtain an encoded bit sequence of length N, and outputs the encoded bit sequence. Wherein, any first position set of a second sequence of length X in the first reliability sequence includes at least one pair of position indices (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B; the reliability of the A-th position index is greater than the reliability of the B-th position index, and the i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, i = 0, 1, ..., N / X-1, X is less than or equal to N, N and X are both integer powers of 2, and K is a positive integer.

[0076] In this embodiment of the application, the reliability of the Ath position index in at least one set of position index pairs (A, B) of the first position set is greater than the reliability of the Bth position index. The number of second sequences including the first position set increases, which can reduce the number of sorting types of the reliability of the subsequences (i.e., the second sequences) of the first reliability sequence, thereby reducing the implementation complexity of polar coding and polar decoding.

[0077] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0078] The encoding and decoding methods provided in this application can be used in any communication system. This communication system can be a third-generation partnership project (3GPP) communication system, such as a long-term evolution (LTE) system; it can also be a 5G mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, an NR vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an internet of things (IoT) system, a narrowband internet of things (NB-IoT) system, a global system for mobile communications (GSM), an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, or a code division multiple access 2000 system. Access, CDMA2000, Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Enhanced Mobile Broadband (eMBB), Ultra-Reliable and Low-Latency Communication (URLLC), Enhanced Machine-Type Communication (eMTC), and various types of future communication systems are also included. This also applies to non-terrestrial network (NTN) systems (such as satellite communication systems), non-3GPP communication systems, etc., without restriction.

[0079] The encoding and decoding methods provided in this application can be applied to various communication scenarios. For example, they can be applied to one or more of the following communication scenarios: encoding and decoding of control channels, encoding and decoding of data channels, etc., without limitation.

[0080] The following is based on Figure 2 Taking an example, the communication system provided in the embodiments of this application will be described.

[0081] Figure 2 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 2 As shown, the communication system may include at least one terminal device and at least one network device.

[0082] in, Figure 2 The terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting end device, and the terminal device is the receiving end device); the terminal device can also use channel coding to encode uplink data and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting end device, and the network device is the receiving end device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting end device and the receiving end device can both be network devices or both be terminal devices, without restriction.

[0083] Figure 2 The terminal equipment in this context can be a device with wireless transceiver capabilities or a chip or chip system that can be configured on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. Terminal equipment can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0084] For example, Figure 2The terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAPUE), wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in smart cities, and wireless terminals in smart homes. Wireless terminals in the home, vehicle devices with vehicle-to-everything (V2X) communication capabilities (such as vehicle devices, vehicle modules, vehicle chips, on-board units (OBUs) or telematics boxes (T-BOXs)), intelligent connected vehicles, drones with UAV-to-UAV (U2U) communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs) are not restricted.

[0085] in, Figure 2The network equipment in this context can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system configurable within such devices, a logical node or module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network equipment can be either wired or wireless access-enabled.

[0086] For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, baseband units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0087] In another example, network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different locations; for example, the RRU can be deployed remotely to a high-traffic area, while the BBU is located in a central equipment room. Alternatively, the BBU and RRU can be located in the same equipment room. The BBU and RRU can also be different components within the same rack.

[0088] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

[0089] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0090] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an open radioaccess network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through a software module, a hardware module, or a combination of software and hardware modules.

[0091] Optionally, the communication system provided in this application embodiment may further include artificial intelligence (AI) network elements to implement some or all AI-related operations. AI network elements may also be referred to as AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI ​​network element may be built into a network element within the communication system. For example, the 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 the core network equipment and / or the access network equipment. Alternatively, the AI ​​network element may also be an independently configured network element within the communication system. Optionally, the terminal device or its built-in chip may also include an AI entity to implement AI-related functions.

[0092] Based on the above description of the terminal device and network device, optionally, the encoding method or decoding method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as chips, chip systems, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0093] Optionally, in the embodiments of this application, the transmitting device (or source) and the receiving device (or sink) can be adopted. Figure 3 The process shown involves encoding and decoding. The transmitting device can be... Figure 2 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 2 Any terminal device or network device in the communication system shown.

[0094] The transmitting device can perform source encoding on its own generated bits to obtain a source bit stream, perform channel encoding on the source bit stream, and then modulate it before transmitting the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it can demodulate them, then perform channel decoding to recover the source bit stream, and finally perform source decoding to obtain the decoding result.

[0095] In practical implementation, Figure 2 As shown in the figure: various terminal devices and network devices can adopt Figure 4The shown composition structure, or including Figure 4 The components shown. Figure 4 This is a schematic diagram illustrating the composition of a communication device 400 provided in an embodiment of this application. The communication device 400 can be a terminal device or a chip or system-on-a-chip within a terminal device; it can also be a network device or a chip or system-on-a-chip within a network device. For example... Figure 4 As shown, the communication device 400 includes a processor 401, a communication interface 402, and a communication line 403.

[0096] Furthermore, the communication device 400 may also include a memory 404. The processor 401, memory 404, and communication interface 402 can be connected via a communication line 403.

[0097] The processor 401 can be a central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 401 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0098] Communication interface 402 is used to communicate with other communication devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Communication interface 402 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0099] Communication line 403 is used to transmit information between the components included in communication device 400.

[0100] Memory 404 is used to store instructions. These instructions can be computer programs.

[0101] The memory 404 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0102] It should be noted that the memory 404 can exist independently of the processor 401 or can be integrated with the processor 401. The memory 404 can be used to store instructions, program code, or some data, etc. The memory 404 can be located inside or outside the communication device 400, without limitation. The processor 401 is used to execute the instructions stored in the memory 404 to implement the encoding or decoding methods provided in the following embodiments of this application.

[0103] In one example, processor 401 may include one or more CPUs, for example Figure 4 CPU0 and CPU1 in the CPU.

[0104] As an optional implementation, the communication device 400 includes multiple processors, for example, besides Figure 4 In addition to processor 401, it may also include processor 407.

[0105] As an optional implementation, the communication device 400 also includes an output device 405 and an input device 406. For example, the input device 406 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 405 is a device such as a display screen or speaker.

[0106] It should be noted that the communication device 400 can be a desktop computer, laptop computer, network server, mobile phone, tablet computer, wireless terminal, embedded device, chip system, or other device. Figure 4 Equipment with a similar structure. Furthermore... Figure 4 The structural composition shown does not constitute a limitation on the communication device, except... Figure 4 In addition to the components shown, the communication device may include more or fewer components than illustrated, or combine certain components, or have different component arrangements.

[0107] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0108] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0109] The following is combined with Figure 2 The communication system shown refers to the following Figure 5 This application describes the encoding and decoding methods provided in its embodiments. The transmitting device can refer to a transmitting device, a component within that transmitting device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the transmitting device's functions. The transmitting device can be... Figure 2 Any terminal device or network device in the communication system shown. The receiving end device can refer to the receiving end device itself, a component within the receiving end device (e.g., a processor, chip, or chip system), or a logic module or software that implements all or part of the functions of the receiving end device. The receiving end device can also be... Figure 2 Any terminal device or network device in the communication system shown. The transmitting or receiving device described in the following embodiments may include Figure 4 The component shown.

[0110] Figure 5 A flowchart of an encoding method and a decoding method provided for embodiments of this application is shown below. Figure 5 As shown, the method may include:

[0111] Step 501: The transmitting device maps the information bit sequence of length K to the bit sequence to be encoded of length N according to the first reliability sequence of length N.

[0112] The information bit sequence can include the information bits themselves, and K can be the number of information bits included in the information bit sequence. Alternatively, the information bit sequence can include information bits and cyclic redundancy check (CRC) bits, meaning the information bit sequence can be a CRC-encoded information bit sequence, and K can be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Or, the information bit sequence can include information bits, CRC bits, and check bits, and K can be the sum of the number of information bits, the number of CRC bits, and the number of check bits included in the information bit sequence. K is a positive integer.

[0113] The i-th second sequence includes the i*X-th position index to the (i+1)*X-1-th position index in the first reliability sequence, i = 0, 1, ..., N / X-1, X is less than or equal to N, and N and X are both integer powers of 2.

[0114] It is understandable that the above description can also be replaced with: the i-th second sequence includes position indices i*X to (i+1)*X-1 in the first reliability sequence. The order of position indices i*X to (i+1)*X-1 in the second sequence is consistent with the order of position indices i*X to (i+1)*X-1 in the first reliability sequence. This second sequence can also be called a subsequence of the first reliability sequence, that is, the first reliability sequence can include N / X subsequences of length X.

[0115] For example, taking N as 256 and X as 32, the first reliability sequence can include 256 / 32 = 8 second sequences of length 32. The 0th second sequence includes position indices 0 to 31 in the first reliability sequence, the 1st second sequence includes position indices 32 to 63 in the first reliability sequence, the 2nd second sequence includes position indices 64 to 95 in the first reliability sequence, the 3rd second sequence includes position indices 96 to 127 in the first reliability sequence, the 4th second sequence includes position indices 128 to 159 in the first reliability sequence, the 5th second sequence includes position indices 160 to 191 in the first reliability sequence, the 6th second sequence includes position indices 192 to 223 in the first reliability sequence, and the 7th second sequence includes position indices 224 to 255 in the first reliability sequence.

[0116] Specifically, the order of position indices 0-31 in the 0th second sequence is consistent with their order in the first reliability sequence. The order of position indices 32-63 in the 1st second sequence is consistent with their order in the first reliability sequence. ... The order of position indices 224-255 in the 7th second sequence is consistent with their order in the first reliability sequence.

[0117] The first set of positions in any second sequence includes at least one pair of position indexes (A, B), where A represents the A-th position index of the second sequence (or is described as position index A), and B represents the B-th position index of the second sequence (or is described as position index B). A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B. The reliability ordering of any pair of position indexes in the first set is consistent with a partial order relationship between sub-channels. The reliability ordering of at least one pair of position indexes in the first set is consistent with one or more partial order relationships between sub-channels.

[0118] It is understandable that, for any second sequence, i*X can be subtracted from the position indices i*X to (i+1)*X-1 in the second sequence, so that the position indices i*X to (i+1)*X-1 are transformed into 0 to X-1. Based on these 0 to X-1, the first position set of the second sequence includes at least one pair of position indices (A, B).

[0119] The partial order relationship between sub-channels refers to the following: under different channel conditions, for two sub-channels (first sub-channel and second sub-channel), the reliability of the first sub-channel is always greater than the reliability of the second sub-channel, or it can be described as the first sub-channel being more reliable than the second sub-channel. Alternatively, it can also refer to the following: under different channel conditions, for three sub-channels (first sub-channel, second sub-channel, and third sub-channel), the reliability of the first sub-channel is always greater than the reliability of the second sub-channel, and the reliability of the second sub-channel is always greater than the reliability of the third sub-channel.

[0120] For any pair of location indices (A, B) in the first location set, the reliability of the A-th location index is greater than the reliability of the B-th location index. This can be described as follows: the sub-channel corresponding to the A-th location index is more reliable than the sub-channel corresponding to the B-th location index; the location corresponding to the A-th location index is more reliable than the location corresponding to the B-th location index; or, in the first reliability sequence, sorted from low to high reliability, the A-th location index is after the B-th location index; or, sorted from high to low reliability, the A-th location index is before the B-th location index. Alternatively, it can be described as follows: the reliability order of any pair of location indices (A, B) in the first location set is consistent with a partial order relationship between the sub-channels.

[0121] In one possible implementation, the reliability order of the position indices in the first reliability sequence of length N is consistent with the partial order relationship between the N sub-channels, that is, it does not violate the partial order relationship of the sub-channels.

[0122] For example, the first location set includes at least one set of location index pairs (A, B) including at least one set of the following location index pairs: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (8,0), (9,0), (10,0), (11,0), (12,0), (13,0), (14,0), (15,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (8,1), (9,1), (10,1), (11, 1) (12, 1), (13, 1), (14, 1), (15, 1), (3, 2), (4, 2), (5, 2), (6, 2), (7, 2), (8, 2), (9, 2), (10, 2), (11, 2), (12, 2), (13, 2), (14, 2), (15, 2), (5, 3), (6, 3), (7, 3), (9, 3), (10, 3), (11, 3), (12, 3), (13, 3), (14, 3), (15, 3), (5, 4), (6, 4), (7, 4) (8,4), (9,4), (10,4), (11,4), (12,4), (13,4), (14,4), (15,4), (6,5), (7,5), (9,5), (10,5), (11,5), (12,5), (13,5), (14,5), (15,5), (7,6), (10,6), (11,6), (12,6), (13,6), (14,6), (15,6), (11,7), (13,7), (14,7), (15,7), (9,8) (10, 8), (11, 8), (12, 8), (13, 8), (14, 8), (15, 8), (10, 9), (11, 9), (12, 9), (13, 9), (14, 9), (15, 9), (11, 10), (12, 10), (13, 10), (14, 10), (15, 10), (13, 11), (14, 11), (15, 11), (13, 12), (14, 12), (15, 12), (14, 13), (15, 13), or (15, 14).

[0123] It is understandable that when the length X of the second sequence is 16, the maximum value of A and B is 15, and the first position set of any second sequence includes at least one set of position index pairs mentioned above.

[0124] When the length X of the second sequence is 8, the maximum value of A and B is 7. The first position set of any second sequence includes at least one set of position index pairs as follows: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (3,2), (4,2), (5,2), (6,2), (7,2), (5,3), (6,3), (7,3), (5,4), (6,4), (7,4), (6,5), (7,5), or (7,6).

[0125] Furthermore, the first position set of different second sequences may include at least one set of position index pairs that are the same or different, without restriction.

[0126] It is understandable that the reliability ranking among the aforementioned location index pairs has an inheritance relationship. For example, if the reliability of location index A is greater than that of location index B, and the reliability of location index B is greater than that of location index C, then the reliability of location index A is greater than that of location index C. In this case, the reliability ranking of the location index set (A, B, C) can also be considered consistent with a partial order relationship between sub-channels. That is to say, the first location set can be defined at the granularity of location index pairs, or at the granularity of the location index set itself, which can include at least three location indices.

[0127] Based on this, compared with the reliability sequence shown in Table 1 above, the number of second sequences including the first position set is increased, which can reduce the number of sorting types of the reliability of the subsequences (i.e., the second sequences) of the first reliability sequence, thereby reducing the implementation complexity of polar coding and polar decoding.

[0128] Based on the above description of the information bit sequence and the first reliability sequence, the transmitting device can map the information bit sequence of length K to the bit sequence to be encoded of length N.

[0129] In the first possible design, the transmitting device can determine the reliability of each position in the bit sequence to be encoded based on the first reliability sequence, and map the information bit sequence of length K to the K positions with high reliability in the bit sequence to be encoded.

[0130] For example, with K = 4 and the first reliability sequence being 0, 1, 2, 4, 3, 5, 6, 7, the transmitting device can map the information bit sequence to the four positions with the highest reliability in the bit sequence to be encoded (i.e., [3, 5, 6, 7]).

[0131] In the second possible design, the transmitting device can determine the reliability of each position in the bit sequence to be encoded based on the first reliability sequence, and map the information bit sequence of length K to the K positions in the bit sequence to be encoded with high reliability, excluding the rate matching position.

[0132] In the third possible design, the transmitting device can determine the reliability of each position in the bit sequence to be encoded based on the first reliability sequence, and map the information bit sequence of length K to the K positions with high reliability in the bit sequence to be encoded, excluding the pre-frozen bit positions.

[0133] The pre-frozen bit positions may include rate-matching bit positions and additional frozen bit positions.

[0134] In the fourth possible design, the transmitting device can also divide the bit sequence to be encoded into N / X sub-blocks of length X based on each of the second sequences in the first reliability sequence, determine the reliability of each position in the i-th sub-block according to the i-th second sequence, and then divide the K bits in the information bit sequence into... i The bits are mapped to the K with the highest reliability in the i-th sub-block. i There are positions, K0+K1+…+K N / X-1 =K.

[0135] For example, with K = 10, the first reliability sequence being 0, 1, 2, 4, 8, 3, 5, 6, 9, 10, 12, 7, 11, 13, 14, 15, and X = 8, the 0th second sequence is 0, 1, 2, 4, 3, 5, 6, 7, and the 1st second sequence is 8, 9, 10, 12, 11, 13, 14, 15. The transmitting device can divide the bit sequence to be encoded into two sub-blocks of length 8. The 0th sub-block corresponds to the 0th second sequence, and the 1st sub-block corresponds to the 1st second sequence. Three bits in the information bit sequence can be mapped to the three positions with the highest reliability in the 0th sub-block (i.e., [5, 6, 7]), and seven bits in the information bit sequence can be mapped to the seven positions with the highest reliability in the 1st sub-block (i.e., [9, 10, 12, 11, 13, 14, 15]).

[0136] Optionally, before mapping the information bit sequence to the bit sequence to be encoded of length N, the transmitting device may perform a first transformation (or describe it as shaping, forming, probability shaping, or distribution matching, etc.) on some or all of the bits in the information bit sequence, and map the first transformed sequence to the bit sequence to be encoded of length N based on the first reliability sequence.

[0137] Optionally, the transmitting device may perform a first transformation on some or all of the bits in the information bit sequence based on a first reliability sequence, using a first encoding method or a decoding method corresponding to the first encoding method. For example, the first encoding method may be polar coding.

[0138] Step 502: The transmitting device performs polar coding on the bit sequence to be encoded to obtain a coded bit sequence of length N.

[0139] Step 503: The transmitting device outputs the encoded bit sequence.

[0140] Optionally, the transmitting device can also perform rate matching on the encoded bit sequence to obtain a rate-matched bit sequence.

[0141] Optionally, the transmitting device can also modulate the rate-matched bit sequence to obtain a modulated symbol sequence.

[0142] Based on the above description, the transmitting device can send a modulation symbol sequence to the receiving device, and correspondingly, the receiving device can receive the decoding information from the transmitting device as shown in step 504 below.

[0143] Step 504: The receiving device receives the information to be decoded.

[0144] The modulation symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference when transmitted through the channel. The information to be decoded received by the receiving device is the modulation symbol sequence affected by noise and other interference.

[0145] The length of the encoded bit sequence corresponding to the information to be decoded is N, where N is an integer power of 2.

[0146] Step 505: The receiving device performs polarization decoding on the information to be decoded according to the first reliability sequence to obtain the decoding result.

[0147] The description of the first reliability sequence can be found in the relevant description of step 501 above, and will not be repeated here.

[0148] Optionally, corresponding to the transmitting device performing a first transformation (optional), polar coding, rate matching, and modulation on the information bit sequence, the receiving device can perform demodulation, rate matching, polar decoding, and a first inverse transformation (optional) on the information to be decoded to obtain the decoding result.

[0149] Based on the above Figure 5The method shown has a higher reliability of the A-th position index in at least one pair of position indexes (A, B) of the first position set than the B-th position index. The increased number of second sequences including the first position set can reduce the number of sorting types of the reliability of the subsequences (i.e., the second sequences) of the first reliability sequence, thereby reducing the implementation complexity of polar coding and polar decoding.

[0150] Based on the above description of the first reliability sequence, and referring to the following three possible designs, the second sequence in the first reliability sequence is illustrated with examples:

[0151] In the first possible design, the length of the second sequence is 8, and the number of sorting types of the position index reliability of the I third sequences corresponding to the I second sequences is 1.

[0152] Where I equals N / X, the m-th position index of the i-th third sequence is the difference between the m-th position index of the i-th second sequence and the first value, where the first value is i*X, and m = 0, 1, ..., X-1. Alternatively, it can be described as: subtracting i*X from the position indices i*X to (i+1)*X-1 in the second sequence, thus converting the position indices i*X to (i+1)*X-1 in the second sequence to 0 to X-1.

[0153] Alternatively, it can be described as follows: Take out the position indices i*8 to (i+1)*8-1 of the first reliability sequence to obtain I second sequences, and subtract i*8 from the position indices i*8 to (i+1)*8-1 of the I second sequences to obtain I third sequences.

[0154] For example, the sorting type of the reliability of the position indices included in the I third sequences is: 0, 1, 2, 4, 3, 5, 6, 7.

[0155] Understandably, the second sequence can be described as a subsequence of the first reliability sequence, and the sorting type of the reliability of the position indices in the third sequence corresponding to the second sequence can be described as the type of the subsequence. Subsequences of the same type have the same reliability sorting, while subsequences of different types have different reliability sorting. When there are many types of subsequences, the receiving device needs to support multiple types of subsequences to achieve parallel decoding, resulting in high implementation complexity.

[0156] In this first possible design, the first set of positions of the second sequence of length 8 includes the following position index pairs: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (3,2), (4,2), (5,2), (6,2), (7,2), (5,3), (6,3), (7,3), (5,4), (6,4), (7,4), (6,5), (7,5), (7,6).

[0157] The reliability sequence shown in Table 1 above has 65 types when the subsequence length is 8. In the first possible design above, the number of subsequence types of the first reliability sequence is 1. Compared with Table 1 above, the first reliability sequence provided by the embodiment of this application can reduce the number of subsequence types and reduce the implementation complexity.

[0158] In the second possible design, the length of the second sequence is 16, and the number of sorting types of the position index reliability of the I third sequences corresponding to the I second sequences is less than or equal to 2.

[0159] Where I equals N / X, the m-th position index of the i-th third sequence is the difference between the m-th position index of the i-th second sequence and the first value, where the first value is i*X, and m = 0, 1, ..., X-1. Alternatively, it can be described as: subtracting i*X from the position indices i*X to (i+1)*X-1 in the second sequence, thus converting the position indices i*X to (i+1)*X-1 in the second sequence to 0 to X-1.

[0160] Alternatively, it can be described as follows: Take out the position indices i*16 to (i+1)*16-1 of the first reliability sequence to obtain I second sequences, and subtract i*16 from the position indices i*16 to (i+1)*16-1 of the I second sequences to obtain I third sequences.

[0161] For example, the sorting type of the reliability of the location indices included in I third sequences includes one or more of the following:

[0162] 0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15; or

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

[0164] In this second possible design, the first set of positions of the second sequence of length 16 includes the following position index pairs: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (8,0), (9,0), (10,0), (11,0), (12,0), (13,0), (14,0), (15,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (8,1), (9,1), (10,1), (11,1). (12,1), (13,1), (14,1), (15,1), (3,2), (4,2), (5,2), (6,2), (7,2), (8,2), (9,2), (10,2), (11,2), (12,2), (13,2), (14,2), (15,2), (5,3), (6,3), (7,3), (9,3), (10,3), (11,3), (12,3), (13,3), (14,3), (15,3), (5,4), (6,4), (7,4) (8,4), (9,4), (10,4), (11,4), (12,4), (13,4), (14,4), (15,4), (6,5), (7,5), (9,5), (10,5), (11,5), (12,5), (13,5), (14,5), (15,5), (7,6), (10,6), (11,6), (12,6), (13,6), (14,6), (15,6), (11,7), (13,7), (14,7), (15,7), (9,8) 、(10,8),(11,8),(12,8),(13,8),(14,8),(15,8),(10,9),(11,9),(12,9),(13,9),(14,9),(15,9),(11,10),(12,10),(13,10),(14,10),(15,10),(13,11),(14,11),(15,11),(13,12),(14,12),(15,12),(14,13),(15,13),(15,14).

[0165] The reliability sequence shown in Table 1 above has 9 types when the length of the subsequence is 16. In the second possible design above, the number of subsequence types of the first reliability sequence is less than or equal to 2. Compared with Table 1 above, the first reliability sequence provided by the embodiment of this application can reduce the number of subsequence types and reduce the implementation complexity.

[0166] Furthermore, it is understood that in the second possible design, the type of subsequence provided has the same position indices 0 to 7 as in the first possible design. In the second possible design, after converting position indices 8 to 15 to 0 to 7, the order of these 0 to 7 is the same as in the first possible design.

[0167] In the third possible design, the length of the second sequence is 32, and the number of sorting types of the position index reliability of the I third sequences corresponding to the I second sequences is less than or equal to 11.

[0168] Where I equals N / X, the m-th position index of the i-th third sequence is the difference between the m-th position index of the i-th second sequence and the first value, where the first value is i*X, and m = 0, 1, ..., X-1. Alternatively, it can be described as: subtracting i*X from the position indices i*X to (i+1)*X-1 in the second sequence, thus converting the position indices i*X to (i+1)*X-1 in the second sequence to 0 to X-1.

[0169] Alternatively, it can be described as follows: Take out the position indices i*32 to (i+1)*32-1 of the first reliability sequence to obtain I second sequences, and subtract i*32 from the position indices i*32 to (i+1)*32-1 of the I second sequences to obtain I third sequences.

[0170] For example, the sorting type of the reliability of the location indices included in I third sequences includes one or more of the following:

[0171] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or

[0172] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or

[0173] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,21,14,22,25,26,28,15,23,27,29,30,31; or

[0174] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or

[0175] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,25,22,26,28,15,23,27,29,30,31; or

[0176] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or

[0177] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,25,22,26,28,15,23,27,29,30,31; or

[0178] 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,19,13,14,21,22,25,26,28,15,23,27,29,30,31; or

[0179] 0,1,2,4,8,16,3,5,9,6,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or

[0180] 0,1,2,4,8,16,3,5,9,6,17,10,18,12,20,24,7,11,19,13,14,21,25,22,26,28,15,23,27,29,30,31; or

[0181] 0,1,2,4,8,16,3,5,6,9,17,10,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31.

[0182] The reliability sequence shown in Table 1 above has 18 types when the subsequence length is 32. In the third possible design above, the number of subsequence types of the first reliability sequence is less than or equal to 11. Compared with Table 1 above, the first reliability sequence provided by the embodiment of this application can reduce the number of subsequence types and reduce the implementation complexity.

[0183] Furthermore, it is understandable that in the third possible design, the type of subsequence provided has the same position indices 0 to 7 as in the first possible design. In the second possible design, after converting position indices 8 to 15 to 0 to 7, the order of these 0 to 7 is the same as in the first possible design.

[0184] In the third possible design, the subsequence types provided have position indices 0 to 15 that are the same as one of the subsequence types provided in the second possible design. In the third possible design, after converting position indices 16 to 31 into 0 to 15, the order of these 0 to 15 is the same as one of the subsequence types provided in the second possible design.

[0185] Based on the above description of the first reliability sequence, the length of the first reliability sequence may optionally be any of the following: 1024, 2048, or 4096, to support the construction of longer Polar codes and improve the design space of the reliability sequence.

[0186] In the first example, taking a first reliability sequence with a length of 1024 as an example, the first reliability sequence can be:

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

[0188] Based on this first example, when N is less than 1024, the first reliability sequence can also be a subsequence of the first example above. That is, the first reliability sequence of length N can include position index 0 to position index N-1 of the first example above. The "order of position index 0 to position index N-1 in the first reliability sequence" is consistent with the "order of position index 0 to position index N-1 in the first example".

[0189] In the second example, taking a first reliability sequence with a length of 1024 as an example, the first reliability sequence can be:

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

[0191] Based on this second example, when N is less than 1024, the first reliability sequence can also be a subsequence of the second example. That is, the first reliability sequence of length N can include position index 0 to position index N-1 of the second example. The "order of position index 0 to position index N-1 in the first reliability sequence" is consistent with the "order of position index 0 to position index N-1 in the second example".

[0192] In the third example, taking a first reliability sequence with a length of 2048 as an example, the position indices i*1024 to (i+1)*1024-1 of the first reliability sequence can be extracted to obtain two second sequences. Subtracting i*1024 from the position indices i*1024 to (i+1)*1024-1 of each of the two second sequences yields two third sequences. Either of these two third sequences can be any reliability sequence of length 1024 from either of the two examples mentioned above, or it can be one of the reliability sequences shown in Table 1. This allows for the construction of longer Polar codes, increases the design space for reliability sequences, and reduces the implementation complexity of reliability sequences.

[0193] In the fourth example, taking a first reliability sequence with a length of 4096 as an example, the position indices i*1024 to (i+1)*1024-1 of the first reliability sequence can be extracted to obtain four second sequences. Subtracting i*1024 from the position indices i*1024 to (i+1)*1024-1 of each of the four second sequences yields four third sequences. Any of these four third sequences can be any reliability sequence of length 1024 from the two examples mentioned above, or it can be one of the reliability sequences shown in Table 1. This allows for the construction of longer Polar codes, increases the design space for reliability sequences, and reduces the implementation complexity of reliability sequences.

[0194] Optionally, reliability sequences of different lengths can be constructed based on the type of the subsequence, using either of the following two methods. This subsequence type can also be called a simplified sequence or a basic sequence.

[0195] Method 1: Construct reliability sequences of different lengths as described below:

[0196] Q base =Q N / / Determine the basic sequence Q base Let Q be a reliability sequence of length N. N

[0197] N = length(Q)base ): / / N is Q base the length of

[0198] While N<N target : / / In the case that N is less than the target N

[0199] I V =kron(Q base ,[1,1])<N / 2; / / Based on Q base and [1,1], the Kronecker product is performed to obtain the position indices of elements whose values are less than N / 2 in the extended reliability sequence Q extend

[0200] I U =kron(Q base ,[1,1])≥N / 2; / / / / Based on Q base and [1,1], the Kronecker product is performed to obtain the position indices of elements whose values are greater than or equal to N / 2 in Q extend

[0201] Q extend (I V )=Q base / / Sequentially fill the elements in Q base into the positions of elements whose values are less than N / 2 in Q extend

[0202] Q extend (I U )=Q base +N / / Sequentially fill the elements in Q base into the positions of elements whose values are greater than or equal to N / 2 in Q extend

[0203] Q base =Q extend / / Update Q base to Q extend

[0204] N=length(Q base ) / / N is Q base the length of

[0205] Based on this first method, for example, taking the initial length of Q base as 1024 as an example, Q base is extended based on the above method to obtain a reliability sequence with a length of 2048. Based on the reliability sequence with a length of 2048, the reliability sequence with a length of 2048 is extended with reference to the above method, so as to obtain a reliability sequence with a length of 4096.

[0206] ​​​​Method 2: Construct reliability sequences of different lengths based on the type of subsequence, according to the following method.

[0207] Specifically, for a given length of 2N, the information bit sequence length K is iterated sequentially from 1 to 2N. For a given K, the number of information bit positions in the first and second subcodes is analyzed and compared with the number of information bit positions when the information bit sequence length is K-1. If the number of information bit positions in the first subcode increases by 1, a sequence number is read from the base sequence of length N as a sequence number in the reliability sequence of length 2N. Otherwise, another sequence number is read from the base sequence and added to N as a sequence number in the reliability sequence of length 2N. By iterating K from 1 to 2N in this way, the reliability sequence of length 2N is determined.

[0208] The first subcode corresponds to the portion of a 2N-length Polar code numbered 0 to N-1, and can also be called the V code. The number of information bit positions in the first subcode can be determined by mutual information, capacity allocation, density evolution, etc. The second subcode corresponds to the portion of a 2N-length Polar code numbered N to 2N-1, and can also be called the U code.

[0209] For example, the number of information bit positions corresponding to the first sub-code can be calculated and determined by referring to the following formula:

[0210]

[0211] Where K1 represents the number of information bit positions in the first subcode. After determining K1, the number of information bit positions in the second subcode is K2 = K - K1.

[0212] Where J(X)=1-exp(a*X) 3 +b*X 2 +c*X+d), a=1.81491E-3, b=-1.42675E-1, c=-8.22054E-2, d=5.49608E-2.

[0213] Alternatively, an approximation algorithm can be used to simplify the implementation of the function J(X), and this application does not impose any restrictions on this.

[0214] Based on the above method two, it is possible to extend the basic sequence of length N to obtain a reliability sequence of length 2N.

[0215] It should be noted that the various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0216] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0217] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0218] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0219] When dividing each function into modules according to its corresponding function. Figure 6 A transmitting device 60 is shown, which can perform the above-described... Figure 5 The actions performed by the transmitting device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0220] The transmitting device 60 may include a transceiver module 601 and a processing module 602. Exemplarily, the transmitting device 60 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 60 is a communication device, the transceiver module 601 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 602 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 60 is a component having the aforementioned transmitting device functions, the transceiver module 601 may be a radio frequency unit; the processing module 602 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 60 is a chip system, the transceiver module 601 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 602 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 601 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 602 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0221] For example, the transceiver module 601 can be used to perform... Figure 5 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; the processing module 602 can be used to perform Figure 5 The embodiments shown include all operations performed by the transmitting device other than the transmit / receive operations, and / or other processes used to support the techniques described herein.

[0222] Figure 7 A receiving device 70 is shown, which can perform the above-described... Figure 5 The actions performed by the receiving device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0223] The receiving device 70 may include a transceiver module 701 and a processing module 702. Exemplarily, the receiving device 70 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions applied in a communication device. When the receiving device 70 is a communication device, the transceiver module 701 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 702 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 70 is a component having the aforementioned receiving device functions, the transceiver module 701 may be a radio frequency unit; the processing module 702 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 70 is a chip system, the transceiver module 701 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 702 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 701 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 702 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0224] For example, the transceiver module 701 can be used to perform... Figure 5 In the illustrated embodiment, all transmit and receive operations performed by the receiving device, and / or other processes used to support the techniques described herein; the processing module 702 can be used to perform Figure 5 The embodiments shown include all operations performed by the receiving device other than the transmit / receive operations, and / or other processes used to support the techniques described herein.

[0225] As another feasible approach Figure 6 The transceiver module 601 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 601; the processing module 602 can be replaced by a processor, which can integrate the functions of the processing module 602. Furthermore, Figure 6 The transmitting device 60 shown may also include a memory. Alternatively, Figure 7 The transceiver module 701 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 701; the processing module 702 can be replaced by a processor, which can integrate the functions of the processing module 702. Furthermore, Figure 7 The receiver device 70 shown may also include a memory.

[0226] Alternatively, when the processing module 602 is replaced by a processor and the transceiver module 601 is replaced by a transceiver, the transmitting end device 60 involved in the embodiments of this application can also be... Figure 8The communication device 80 shown. Alternatively, when the processing module 702 is replaced by a processor and the transceiver module 701 is replaced by a transceiver, the receiving end device 70 involved in the embodiments of this application can also be... Figure 8 The communication device 80 shown.

[0227] The processor can be logic circuit 801, and the transceiver can be interface circuit 802. Furthermore, Figure 8 The communication device 80 shown may also include a memory 803.

[0228] This application also provides a communication device, such as... Figure 9 As shown, this communication device can be applied to the above-mentioned... Figure 5 In the method shown, such as Figure 9 As shown, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the device (such as a transmitting device or a receiving device) involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0229] In one example, the communication device functions as a transmitting (or receiving) device or a chip applied within the transmitting (or receiving) device, and executes the steps performed by the transmitting (or receiving) device in the above method embodiments. The transceiver module is used for specific execution. Figure 5 The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, to support the sending device (or receiving device) in performing other processes of the technology described herein.

[0230] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0231] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0232] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to perform... Figure 5 The method involved in any of the embodiments shown is further described below. The processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is primarily responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is primarily responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and translations. The registers are primarily responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS), an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an in-chip storage module, such as a register or cache. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0233] It should be noted that the functions of the processor and interface can be implemented through hardware design, software design, or a combination of both; no restrictions are imposed here.

[0234] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0235] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0236] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0237] It should be noted that the terms "first" and "second," etc., in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0238] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0239] It should be understood that in this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action at the time of implementation, nor do they imply any other limitations.

[0240] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0241] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0242] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0243] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0244] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0245] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0246] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

1. An encoding method, characterized in that, include: Based on a first reliability sequence of length N, an information bit sequence of length K is mapped to a bit sequence to be encoded of length N. The first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indices (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B. The reliability of the A-th position index is greater than the reliability of the B-th position index. The i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, where i = 0, 1, ..., N / X-1, X is less than or equal to N, N and X are both integer powers of 2, and K is a positive integer. The bit sequence to be encoded is polar encoded to obtain an encoded bit sequence of length N; Output the encoded bit sequence.

2. A decoding method, characterized in that, include: Receive information to be decoded; wherein the length of the encoded bit sequence corresponding to the information to be decoded is N, and N is an integer power of 2; According to the first reliability sequence, polar decoding is performed on the information to be decoded to obtain the decoding result. The first position set of any second sequence of length X in the first reliability sequence includes at least one pair of position indices (A, B), where A represents the A-th position index of the second sequence, B represents the B-th position index of the second sequence, A is greater than or equal to 0 and less than or equal to X-1, B is greater than or equal to 0 and less than or equal to X-1, and A is not equal to B. The reliability of the A-th position index is greater than the reliability of the B-th position index. The i-th second sequence includes the i*X-th to (i+1)*X-1-th position indices in the first reliability sequence, where i = 0, 1, ..., N / X-1, X is less than or equal to N, and X is an integer power of 2.

3. The method according to claim 1 or 2, characterized in that, The at least one set of location index pairs (A, B) includes at least the following set of location index pairs: (1,0), (2,0), (3,0), (4,0), (5,0), (6,0), (7,0), (8,0), (9,0), (10,0), (11,0), (12,0), (13,0), (14,0), (15,0), (2,1), (3,1), (4,1), (5,1), (6,1), (7,1), (8,1), (9,1), (10,1), (11,1), (12,1) (13,1), (14,1), (15,1), (3,2), (4,2), (5,2), (6,2), (7,2), (8,2), (9,2), (10,2), (11,2), (12,2), (13,2), (14,2), (15,2), (5,3), (6,3), (7,3), (9,3), (10,3), (11,3), (12,3), (13,3), (14,3), (15,3), (5,4), (6,4), (7,4), (8,4) ), (9, 4), (10, 4), (11, 4), (12, 4), (13, 4), (14, 4), (15, 4), (6, 5), (7, 5), (9, 5), (10, 5), (11, 5), (12, 5), (13, 5), (14, 5), (15, 5), (7, 6), (10, 6), (11, 6), (12, 6), (13, 6), (14, 6), (15, 6), (11, 7), (13, 7), (14, 7), (15, 7), (9, 8), (1 0,8),(11,8),(12,8),(13,8),(14,8),(15,8),(10,9),(11,9),(12,9),(13,9),(14,9),(15,9),(11,10),(12,10),(13,10),(14,10),(15,10),(13,11),(14,11),(15,11),(13,12),(14,12),(15,12),(14,13),(15,13), or(15,14).

4. The method according to any one of claims 1-3, characterized in that, The second sequence has a length of 8, and the number of sorting types for the reliability of the position indices of the I third sequences corresponding to the I second sequences is 1, or The second sequence has a length of 16, and the number of sorting types for the reliability of the position indices of the I third sequences corresponding to the second sequence is less than or equal to 2, or The length of the second sequence is 32, and the number of sorting types of the position index reliability of the I third sequences corresponding to the second sequence is less than or equal to 11; Wherein, I equals N / X, the m-th position index of the i-th third sequence is the difference between the m-th position index of the i-th second sequence and the first value, the first value is i*X, and m = 0, 1, ..., X-1.

5. The method according to claim 4, characterized in that, The sorting type of the reliability of the position indices included in the I third sequences is: 0, 1, 2, 4, 3, 5, 6, 7.

6. The method according to claim 4, characterized in that, The sorting type for the reliability of the position indices included in the I third sequences includes one or more of the following: 0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15; or 0,1,2,4,8,3,5,9,6,10,12,7,11,13,14,15。 7. The method according to claim 4, characterized in that, The sorting type for the reliability of the position indices included in the I third sequences includes one or more of the following: 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,7,24,11,13,19,21,14,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,14,19,21,25,22,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,13,19,14,21,25,22,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,10,17,12,18,20,24,7,11,19,13,14,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,9,6,10,17,12,18,20,7,24,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,9,6,17,10,18,12,20,24,7,11,19,13,14,21,25,22,26,28,15,23,27,29,30,31; or 0,1,2,4,8,16,3,5,6,9,17,10,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31。 8. The method according to any one of claims 1-7, characterized in that, The length of the first reliability sequence is any one of the following: 1024, 2048, or 4096.

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

12. A communication device, characterized in that, Includes a module for performing the decoding method according to any one of claims 2-10.

13. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the encoding method as described in any one of claims 1, 3-10 to be executed, or cause the decoding method as described in any one of claims 2-10 to be executed.

14. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the encoding method as described in any one of claims 1, 3-10, or to execute the decoding method as described in any one of claims 2-10, to process and / or generate the information based on the information.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the encoding method as described in any one of claims 1, 3-10 to be executed, or cause the decoding method as described in any one of claims 2-10 to be executed.

16. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the encoding method as described in any one of claims 1, 3-10 to be executed, or the decoding method as described in any one of claims 2-10 to be executed.