# US 12,015,480 B2 · Systems and methods for using not perfectly polarized bit channels in parallel polar codes > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,015,480 B2 - Document ID: US12015480B2 - Status: Granted - Kind: B2 - Application number: 18/070,035 - Filed: 2022-11-28 - Published: 2023-04-06 - Granted: 2024-06-18 - Earliest claimed: 2021-01-29 - Assignees: Huawei Technologies Co., Ltd. - Applicants: Huawei Technologies Co., Ltd. - Inventors: Hamid Ebrahimzad; Zhuhong Zhang - Web page: https://patentgrep.com/patent/US12015480B2 ## CPC - H04L 1/0041: {Arrangements at the transmitter end} - H04L 1/0042: {Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape (H04L1/0067 takes precedence)} - H03M 13/13: Linear codes - H03M 13/611: {Specific encoding aspects, e.g. encoding by means of decoding} - H03M 13/6561: {Parallelized implementations} - H04L 1/0054: {Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms} - H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)} - H04L 1/0065: {Serial concatenated codes} - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) ## Abstract The disclosed systems, structures, and methods are directed to encoding and decoding information for transmission across a communication channel. The encoding method includes: distributing the information bits between m parallel polar codes such that each of the m parallel polar codes includes a subset of the information bits; splitting the subset of information bits in each of the m parallel polar codes into a protected information section and a full rate information section; protecting information bits in the protected information section of each of the m parallel polar codes; arranging a plurality of frozen bits in each of the m parallel polar codes; and generating a polar encoded codeword for each of the m parallel polar codes. ## Claims ### Claim 1 A method for encoding information bits for transmission across a communication channel, the method comprising: distributing information bits between m parallel polar codes such that each of the m parallel polar codes includes a subset of the information bits, wherein m is the number of parallel polar codes; splitting the subset of information bits in each of the m parallel polar codes into a protected information section and a full rate information section, information bits in the protected information section of each of the m parallel polar codes being arranged in positions in a plurality of first bit channels in the respective parallel polar code of the m parallel polar codes and grouped into a plurality of L blocks, wherein each of the plurality of L blocks comprises a subset of the information bits in the protected information section for each of the m parallel polar codes, wherein L is the number of blocks; protecting the information bits in the protected information section of each of the m parallel polar codes; arranging a plurality of frozen bits in each of the m parallel polar codes, with the plurality of frozen bits being arranged in positions in a plurality of second bit channels that have a capacity near zero; and generating a polar encoded codeword for each of the m parallel polar codes. ### Claim 2 (depends on 1) The method of claim 1, wherein the plurality of first bit channels are bit channels that have a capacity between 0 and 1. ### Claim 3 (depends on 1) The method of claim 1, wherein the plurality of first bit channels are non-perfectly polarized bit channels. ### Claim 4 (depends on 1) The method of claim 1, wherein the information bits in the protected information section of each of the m parallel polar codes are protected using a repetition code. ### Claim 5 (depends on 4) The method of claim 4, wherein the information bits in a block of the plurality of L blocks of a first parallel polar code from the m parallel polar codes are repeated in a block of the plurality of L blocks of a second parallel polar code from the m parallel polar codes. ### Claim 6 (depends on 5) The method of claim 5, wherein the information bits in a block of the plurality of L blocks of a first parallel polar code from the m parallel polar codes are repeated di times in the m parallel polar codes, di being a factor of m and greater than one. ### Claim 7 (depends on 1) The method of claim 1, wherein a total number of the plurality of blocks in the non-perfectly polarized bit channels in each of the m parallel polar codes is determined based on a total number of greater-than-one factors of m. ### Claim 8 A decoding method, comprising: receiving m polar coded codewords over a communication channel, each of the m polar coded codewords encoding a subset of information bits in a plurality of nodes and a frozen bit, wherein the information bits are distributed between the m polar coded codewords and m is the number of polar coded codewords; and for each of the m polar coded codewords, decoding the polar coded codewords to generate a decoded message comprising a decoded bit for the frozen bit, a first part for a node in a full rate information section of the polar coded codeword and a second part for a node in a protected information section of the polar coded codeword, wherein the decoded bit is generated based on a predetermined value, the first part is generated based on a log-likelihood ratio (LLR) decoding algorithm and the second part is generated based on an averaged LLR decoding algorithm. ### Claim 9 (depends on 8) The method of claim 8, wherein the decoding of the node is performed by a successive-cancellation (SC) or a successive-cancellation-list (SCL). ### Claim 10 (depends on 8) The method of claim 8, wherein the averaged LLR decoding algorithm is based on: L ⁢ L ⁢ R k n = 1 K ⁢ ∑ j = ( k - 1 ) * d i + 1 k * d i L ⁢ L ⁢ R j o where ≤ k ≤ m d i , di is a total number of repetitions for the node in the m polar coded codewords, n represents that LLRkn are new modified LLRs, and LLRjo is the original LLR of the node in the respective codeword j in the m polar coded codewords, j=1 . . . m, K represents that the number of LLRs that are involved in averaging, and “*” here indicates the mathematical operation of multiplication. ### Claim 11 An encoder that encodes information bits for transmission across a communication channel, the encoder comprising at least one processor and a memory storing programmed instructions that, when executed by the at least one processor, cause the encoder to perform the following steps: distributing the information bits between m parallel polar codes such that each of the m parallel polar codes includes a subset of the information bits, wherein m is the number of parallel polar codes; splitting the subset of information bits in each of the m parallel polar codes into a protected information section and a full rate information section, information bits in the protected information section of each of the m parallel polar codes being arranged in positions in a plurality of first bit channels in the respective parallel polar code of the m parallel polar codes and grouped into a plurality of L blocks, wherein each of the plurality of L blocks comprises a subset of the information bits in the protected information section, wherein L is the number of blocks; protecting the information bits in the protected information section of each of the m parallel polar codes; arranging a plurality of frozen bits in each of the m parallel polar codes, with the plurality of frozen bits being arranged in positions in a plurality of second bit channels that have a capacity near zero; and generating a polar encoded codeword for each of the m parallel polar codes. ### Claim 12 (depends on 11) The encoder of claim 11, wherein the plurality of first bit channels are bit channels that have a capacity between 0 and 1. ### Claim 13 (depends on 11) The encoder of claim 11, wherein the plurality of first bit channels are non-perfectly polarized bit channels. ### Claim 14 (depends on 11) The encoder of claim 11, wherein the information bits in the protected information section of each of the m parallel polar codes are protected using a repetition code. ### Claim 15 (depends on 11) The encoder of claim 11, wherein the information bits in a block of the plurality of L blocks of a first parallel polar code from the m parallel polar codes are repeated in a block of the plurality of L blocks of a second parallel polar code from the m parallel polar codes. ### Claim 16 (depends on 15) The encoder of claim 15, wherein the information bits in a block of the plurality of L blocks of a first parallel polar code from the m parallel polar codes are repeated di times in the m parallel polar codes, di being a factor of m and greater than one. ### Claim 17 A decoder comprising: at least one processor and a memory storing programmed instructions that, when executed by the at least one processor, cause the decoder to perform the following steps: receiving m polar coded codewords over a communication channel, each of the m polar coded codewords encoding a subset of information bits in a plurality of nodes and a frozen bit, wherein the information bits are distributed between the m polar coded codewords and m is the number of polar coded codewords; and for each of the m polar coded codewords, decoding the polar coded codeword to generate a decoded message comprising a decoded bit for the frozen bit, a first part for a node in a full rate information section of the polar coded codeword and a second part for a node in a full rate information section of the polar coded codeword, wherein the decoded bit is generated based on a predetermined value, the first part is generated based on a log-likelihood ratio (LLR) decoding algorithm and the second part is generated based on an averaged LLR decoding algorithm. ### Claim 18 (depends on 17) The decoder of claim 17, wherein the averaged LLR decoding algorithm is based on: L ⁢ L ⁢ R k n = 1 K ⁢ ∑ j = ( k - 1 ) * d i + 1 k * d i L ⁢ L ⁢ R j o where ≤ k ≤ m d i , di is a total number of repetitions for the node in the m polar coded codewords, n represents that LLRkn are new modified LLRs, and LLRjo β is the original LLR of the node in the respective codeword j in the m polar coded codewords, j=1 . . . m, K represents that the number of LLRs that are involved in averaging, and “*” here indicates the mathematical operation of multiplication.