[go: up one dir, main page]

WO2020052770A1 - Décodeurs et procédés de décodage de codes polaires et de codes de produits - Google Patents

Décodeurs et procédés de décodage de codes polaires et de codes de produits Download PDF

Info

Publication number
WO2020052770A1
WO2020052770A1 PCT/EP2018/074798 EP2018074798W WO2020052770A1 WO 2020052770 A1 WO2020052770 A1 WO 2020052770A1 EP 2018074798 W EP2018074798 W EP 2018074798W WO 2020052770 A1 WO2020052770 A1 WO 2020052770A1
Authority
WO
WIPO (PCT)
Prior art keywords
codeword
code
decoding
matrix
sub
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/EP2018/074798
Other languages
English (en)
Inventor
Carlo CONDO
Valerio BIOGLIO
Ingmar LAND
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201880095995.0A priority Critical patent/CN112534724B/zh
Priority to PCT/EP2018/074798 priority patent/WO2020052770A1/fr
Publication of WO2020052770A1 publication Critical patent/WO2020052770A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2909—Product codes

Definitions

  • the present invention relates to the fields of channel coding. More specifically, the present invention relates to decoders and corresponding methods for decoding a polar code codeword as well as a product code codeword.
  • a system for forward error correction (FEC) coding also called a coding scheme, consists of an encoder at the transmitter side and a decoder at the receiver side.
  • the encoder adds redundancy to the data to be transmitted, i.e. additional redundant data, and the decoder exploits this redundancy to correct transmission errors, such that the receiver obtains the transmitted data free of errors despite the noisy communication channel.
  • Figure 1 shows such a communication system 100, wherein the data u to be transmitted, termed information word, is given to an encoder 101 , which produces the codeword x containing redundancy. This is then transmitted over a noisy communication channel 103 which typically introduces errors.
  • the output vector y is provided to a decoder 105, which produces estimates of the transmitted codeword and the transmitted data.
  • the set C of possible codewords is called the code, or channel code, and the following is particularly concerned with such a code.
  • Polar codes are linear block codes that rely on the polarization effect, which allows to sort the bit positions of u, called bit-channels, in order of reliability. As the code length goes toward infinity, the polarization phenomenon influences the reliability of bit-channels, which are either completely noisy or completely noiseless. Furthermore, the fraction of noiseless bit-channels equals the channel capacity. More details about polar codes can be found in E. Arikan,“Channel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels,” IEEE Transactions on
  • the polar encoding process consists in the classification of the bit-channels in u into two groups: the K good bit-channels that will carry the information bits and are indexed by the information set /, and the N— K bad bit- channels that are fixed to a predefined value (usually 0) and are indexed by the frozen set F.
  • the K best bit-channels i.e. the ones with the highest reliability, are selected to form the information set, while the remaining bit-channels are frozen.
  • the frozen set F is available to both the encoder and decoder (see figure 1 ).
  • the frozen set F of size N K is chosen, as described above.
  • the bits u* of the input vector u are set to 0 for i e F and to the information bits otherwise.
  • kernels may be used and frozen sets may be defined in alternative ways.
  • SC decoding Successive Cancellation
  • the decoder starts with a decision for bit u x and feeds this decision back into the decoding process; then it makes a decision of bit u 2 and feeds this decision back into the decoding process; it proceeds in this fashion until it obtains the design for the last bit u N .
  • SC list decoding SC stack decoding, or similar decoding algorithms may be applied.
  • Product codes are a class of error-correction codes constructed by encoding a matrix of information symbols row-wise with a row component code, and subsequently column-wise using a column component code, as depicted in figure 2.
  • the twofold encoding acts as a concatenation of the row and column component codes.
  • different component codes may be used for the rows, and different component codes may be used for the columns.
  • Polar product codes have been proposed in T. Koike-Akino et. al.,“Irregular polar turbo product coding for high-throughput optical interface,” in Optical Fiber Communication Conference and Exhibition, 2018, wherein systematic polar codes are used as component codes.
  • a product code In a product code, information bits are arranged in a K c x K r array, then code C r is used to encode the K c rows independently. Afterwards, the N r columns obtained in the previous step are encoded using code C c . The result is an N r x N c array, where rows are codewords of code C r and columns are codewords of code C c .
  • Product codes can be decoded by sequentially decoding rows and column component codes. A product code decoder typically decodes first all the row codewords, which can be done in parallel. Using the results of the row-decoding, the decoder next decodes all the column codewords, which can be done in parallel.
  • the decoder proceeds in this fashion for a certain number of iterations and produces the estimates of the transmitted bits.
  • Soft-input/soft-output decoders are normally used to improve the decoding performance by iterating the decoding of rows and columns and exchanging soft information between the two decoders.
  • Polar code decoding suffers from long decoding latency, due to the sequential nature of SC- based decoding.
  • polar codes as constituent codes raises the problem of combining efficiently product decoding and component code decoding.
  • the information output from the component code decoding needs to be soft.
  • the most effective decoders for polar codes, based on SC decoding return hard information.
  • Soft-output decoding of polar codes is inherently suboptimal, since polar codes achieve capacity under SC decoding, and are constructed targeting SC-based decoding algorithms.
  • Polar codes can be decoded with Successive Cancellation (SC)-based algorithms with good error-correction performance and limited complexity; however, SC-based decoding cannot be well parallelized.
  • SC-based decoding cannot be well parallelized.
  • product decoding is easily parallelizable, but soft-in-soft-out decoding algorithms are necessary in order to improve error-correction performance of product decoding, which are computationally complex and suboptimal for polar codes. No trade-off between these two approaches is currently available in the state of the art.
  • Embodiments of the invention address the problem of how to decode polar codes with low latency, and how to decode product polar codes with enhanced error-correction performance, which is achieved through an observation of polar code properties and the interpretation of product polar codes as polar codes, and vice versa.
  • Embodiments of the invention allow to parallelize the decoding of polar codes, and to exploit the interpretation of polar codes as product codes to use polar decoding as a powerful post-processing step. This allows to combine the speed of product decoding to the efficiency of decoding algorithms that are optimal for polar codes, such as Successive Cancellation (SC) decoding algorithm.
  • SC Successive Cancellation
  • the invention relates to a decoder for decoding a polar code codeword, wherein the polar code codeword results from encoding information data using a polar code encoding scheme and the polar code codeword comprises a plurality of code values.
  • the decoder comprises a processor being configured to: select first successive code values to obtain a first sub-codeword; select second successive code values to obtain a second sub-codeword, the second successive code values following the first successive code values; arrange the first sub-codeword and the second sub-codeword to form a product code matrix comprising a first matrix row with the first successive code values and a second matrix row with the second successive code values, a first matrix column comprising code values of the first sub-codeword and the second sub-codeword, and a second matrix column comprising code values of the first sub-codeword and the second sub-codeword; and decode the product code matrix using a product code decoding scheme to retrieve the information data from the polar codeword.
  • an improved decoder is provided allowing, in particular, for a more efficient decoding of a polar code codeword.
  • the processor is configured to determine a decoding measure indicating decoding quality when decoding the product code matrix, and to decode the polar codeword using a polar code decoding scheme if the decoding measure exceeds or equals to a predetermined threshold.
  • the decoding measure is an error measure indicating decoding errors when decoding the product code matrix.
  • the processor is configured to decode the product code matrix by individually decoding rows and/or columns of the product code matrix.
  • the processor is configured to decode at least two rows of the product code matrix in parallel, and/or to decode at least two columns of the product code matrix in parallel.
  • the polar codeword is based on a frozen bit set comprising positions of frozen bits, the frozen bits not carrying information, wherein each row or column of the product code matrix is based on a frozen bit sub-set, wherein the processor is configured to determine frozen bits in each frozen bit sub-set by replicating a bit vector comprising a logical 1 at a position at which a frozen bit shall be detected and logical zero elsewhere to obtain a replicated bit vector, and to compare the replicated bit vector with a frozen bit sub-set.
  • the invention relates to a decoder for decoding a product code codeword, wherein the product code codeword results from encoding information data using a product code encoding scheme providing a product code matrix comprising matrix rows and matrix columns being formed by values of the product code codeword, each matrix row and matrix column comprising a component codeword.
  • the decoder comprises a processor which is configured to concatenate component codewords to obtain a concatenated codeword with serially arranged code values, and to decode the concatenated codeword using polar code decoding scheme.
  • an improved decoder is provided allowing, in particular, for a more efficient decoding of a product code codeword.
  • the processor is configured to concatenate component codewords arranged in subsequent matrix rows or in subsequent matrix columns to obtain the concatenated codeword.
  • each component code codeword is based on a frozen bit sub-set with frozen bits
  • the processor is configured to replicate frozen bit sub-sets arranged in rows and columns and to compare the replicated frozen bit sub-sets to obtain a frozen bit set of a polar code codeword.
  • the processor is configured to select a bit value for the frozen bit set if corresponding bit values of different frozen bit sub-sets are equal. In particular logical 1.
  • the invention relates to a decoding method for decoding a polar code codeword, wherein the polar code codeword results from encoding information data using a polar code encoding scheme and the polar code codeword comprises a plurality of code values.
  • the decoding method comprises the following steps: selecting first successive code values to obtain a first sub-codeword; selecting second successive code values to obtain a second sub-codeword, the second successive code values following the first successive code values; arranging the first sub-codeword and the second sub-codeword to form a product code matrix comprising a first matrix row with the first successive code values and a second matrix row with the second successive code values, a first matrix column comprising code values of the first sub-codeword and the second sub-codeword, and a second matrix column comprising code values of the first sub-codeword and the second sub-codeword; and decoding the product code matrix using a product code decoding scheme to retrieve the information data from the polar codeword.
  • an improved decoding method is provided allowing, in particular, for a more efficient decoding of a polar code codeword.
  • the decoding method further comprises a step of determining a decoding measure indicating decoding quality when decoding the product code matrix, and to decode the polar codeword using a polar code decoding scheme if the decoding measure exceeds or equals to a predetermined threshold.
  • the invention relates to a decoding method for decoding a product code codeword, wherein the product code codeword results from encoding information data using a product code encoding scheme providing a product code matrix comprising matrix rows and matrix columns being formed by values of the product code codeword, each matrix row and matrix column comprising a component codeword.
  • the decoding method comprises a step of concatenating component codewords to obtain a concatenated codeword with serially arranged code values, and decoding the
  • an improved decoding method is provided allowing, in particular, for a more efficient decoding of a product code codeword.
  • the invention relates to a computer program comprising program code for performing the method according to the second aspect or the method according to fourth aspect when executed on a computer.
  • the invention can be implemented in hardware and/or software.
  • FIG. 1 shows a schematic diagram illustrating a communication system comprising an encoder, a communication channel and a decoder
  • Fig. 2 shows a schematic diagram illustrating an encoding scheme of a product code
  • Fig. 3 shows a schematic diagram illustrating a decoder for decoding a polar code codeword according to an embodiment and a decoder for decoding a product code codeword according to an embodiment
  • Fig. 4 shows a schematic diagram illustrating conversion of polar code to product code performed by a decoder according to an embodiment
  • Fig. 5 shows a schematic diagram illustrating a communication system comprising an encoder, a communication channel, a product code decoder according to an embodiment and a polar code decoder according to an embodiment;
  • Fig. 6 shows a schematic diagram illustrating a method of decoding a polar code codeword according to an embodiment
  • Fig. 7 shows a schematic diagram illustrating a method of decoding a product code codeword according to an embodiment.
  • embodiments of the invention offer in particular the advantages of decoding polar codes with low latency and decoding product polar codes with enhanced error-correction performance, which is achieved through an observation of polar code properties and the interpretation of product polar codes as polar codes, and vice versa.
  • Figure 3 shows a schematic diagram illustrating a decoder 301 for decoding a polar code codeword according to an embodiment and a decoder 31 1 for decoding a product code codeword according to an embodiment.
  • x can be divided in N c segments of N r consecutive bits each, starting from the first bit of x, and can be arranged in a N c x N r matrix X, so that the first column is constituted of the first bit of the N c segments, the second column of the second bit, etc. Furthermore, the first row corresponds to the first JV r -bit segment, the second row to the second segment, etc.
  • the rows and the columns of X are codewords of N r - bit and N c - bit long polar codes respectively and are called component codes.
  • This matrix-like structure is a characteristic of product codes and allows for decoding the row (column) component codes concurrently. Product decoding can thus be applied to polar codes.
  • the decoder 301 as shown in figure 3 can decode a polar code codeword resulting from encoding information data using a polar code encoding scheme and comprises a processor 303 configured to: select first successive code values to obtain a first sub-codeword; select second successive code values to obtain a second sub-codeword, the second successive code values following the first successive code values; arrange the first sub-codeword and the second sub-codeword to form a product code matrix comprising a first matrix row with the first successive code values and a second matrix row with the second successive code values, a first matrix column comprising code values of the first sub-codeword and the second sub-codeword, and a second matrix column comprising code values of the first sub-codeword and the second sub-codeword; and decode the product code matrix using a product code decoding scheme to retrieve the information data from the polar codeword.
  • the processor 303 is configured to determine a decoding measure indicating decoding quality when decoding the product code matrix, and to decode the polar codeword using a polar code decoding scheme if the decoding measure exceeds or equals to a predetermined threshold.
  • the decoding measure is an error measure indicating decoding errors when decoding the product code matrix.
  • the processor 303 is configured to decode the product code matrix by individually decoding rows and/or columns of the product code matrix and to decode at least two rows of the product code matrix in parallel, and/or to decode at least two columns of the product code matrix in parallel.
  • the polar codeword is based on a frozen bit set comprising positions of frozen bits, the frozen bits not carrying information, wherein each row or column of the product code matrix is based on a frozen bit sub-set.
  • the processor 303 is configured to determine frozen bits in each frozen bit sub-set by replicating a bit vector comprising a logical 1 at a position at which a frozen bit shall be detected and logical zero elsewhere to obtain a replicated bit vector, and to compare the replicated bit vector with a frozen bit sub-set.
  • FIG. 4 An exemplary conversion 400 of polar code to product code performed by the decoder 301 is shown in figure 4.
  • a codeword x can be split in V/V sections of length V/v each and the sections can be rearranged one below the other.
  • the resulting V/V x V/V matrix is a non-systematic product code matrix where each row and each column is a valid polar codeword of length V/V.
  • the encoding process of product codes can be expressed as T* u - T r , where 7 ⁇ is the transpose of the transformation matrix for the column component codes and T r is the transformation matrix for the row component codes respectively. They encode the information matrix U into a product codeword X.
  • T c and T r to be the transformation matrices for two polar codes of length N c and N r respectively, the resulting product code is a product polar code.
  • N c rows of X can be chained as the segments of an N c x N r vector x, so that the first row constitutes the first segment, the second row the second segment, etc.
  • vector x is the codeword of a polar code of length N c x N r . Polar decoding can thus be applied to a product code with polar component codes.
  • the decoder 31 1 as shown in figure 3 can decode a product code codeword, wherein the product code codeword results from encoding information data using a product code encoding scheme providing a product code matrix comprising matrix rows and matrix columns being formed by values of the product code codeword, each matrix row and matrix column comprising a component codeword.
  • the decoder 31 1 comprises a processor 313 configured to concatenate component codewords to obtain a concatenated codeword with serially arranged code values, and to decode the concatenated codeword using a polar code decoding scheme.
  • the processor 313 is configured to concatenate component codewords arranged in subsequent matrix rows or in subsequent matrix columns to obtain the concatenated codeword.
  • each component code codeword is based on a frozen bit sub-set with frozen bits
  • the processor 313 is configured to replicate frozen bit sub-sets arranged in rows and columns and to compare the replicated frozen bit sub-sets to obtain a frozen bit set of a polar code codeword. Furthermore, the processor 313 is configured to select a bit value for the frozen bit set if corresponding bit values of different frozen bit sub-sets are equal, in particular logical 1 .
  • the proposed decoding approach foresees the decoding of the rows and column component polar codes as a first step, with information exchanged between the row and column decoding phases in a product-like manner.
  • Product decoding can be parallelized easily, as all rows can be processed in parallel and all columns can be processed in parallel, which substantially reduces the decoding latency for a length-A/ polar code.
  • the overall length- A/ code is decoded with a polar decoding algorithm.
  • the same decoding algorithm can be used for the component codes in the first step and for the overall code in the second step.
  • Any decoding algorithm can be used in any of the two phases, for example both hard-output algorithms such as SC-based decoding algorithms and soft-output decoding algorithms such as belief propagation or soft cancellation (SCAN) algorithms.
  • the speed and implementation complexity of the proposed decoding process are dependent on the number of parallel component code decoders instantiated, the number of product-like iterations, and the percentage of times that the second decoding step is activated.
  • Figure 5 shows a schematic diagram illustrating a communication system 500 comprising an encoder 501 , a communication channel 503, a product code decoder 31 1 according to an embodiment and a polar code decoder 301 according to an embodiment.
  • the modified transmission system 500 in figure 5 shows the new decoding architecture as already discussed above.
  • Embodiments of the invention provide three novel decoding approaches. They are based on the above observation that a polar code codeword can be split into rows of a product code with row and column polar component codes, and vice versa.
  • a polar product code can be decoded with polar code decoding algorithms.
  • a polar code can be decoded with product code decoding algorithms.
  • a hybrid decoding approach can be performed by the following steps: a first step of considering the code as a product code and applying product-code decoding, i.e. iterative decoding of the row and column polar component codes and exchanging of information between the two phases; a second step of considering the code as a single polar code of length N and applying polar decoding in case errors are left after the first step.
  • the first decoding step as mentioned above allows the parallelization of polar code decoding process, reducing latency. Implementation complexity can be tuned depending on the number of parallel component code decoders instantiated.
  • the second decoding step improves the error-correction performance by strengthening the decoding process with the decoding of a longer code. It is activated with a probability g. As channel conditions improve, g tends to be 0, thus having negligible impact on the average decoding latency. To limit the implementation complexity of the second step, the same decoding algorithm can be used for the second step and also for the component codes at the first step, thus maximizing resource sharing.
  • Figure 6 shows a schematic diagram illustrating a method 600 of decoding a polar code codeword, wherein the polar code codeword results from encoding information data using a polar code encoding scheme and the polar code codeword comprises a plurality of code values.
  • the decoding method 600 comprises the following steps: a first step 601 of selecting first successive code values to obtain a first sub-codeword; a second step 603 of selecting second successive code values to obtain a second sub-codeword, the second successive code values following the first successive code values; a third step 605 of arranging the first sub-codeword and the second sub-codeword to form a product code matrix comprising a first matrix row with the first successive code values and a second matrix row with the second successive code values, a first matrix column comprising code values of the first sub-codeword and the second sub-codeword, and a second matrix column comprising code values of the first sub-codeword and the second sub-codeword; and a fourth step 607 of decoding the product code matrix using a product code decoding scheme to retrieve the information data from the polar codeword.
  • Figure 7 shows a schematic diagram illustrating a method 700 of decoding a product code codeword, wherein the product code codeword results from encoding information data using a product code encoding scheme providing a product code matrix comprising matrix rows and matrix columns being formed by values of the product code codeword, each matrix row and matrix column comprising a component codeword.
  • the decoding method 700 comprises a step 701 of concatenating component codewords to obtain a concatenated codeword with serially arranged code values, and a step 703 of decoding the concatenated codeword using a polar code decoding scheme.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

Des décodeurs et des procédés de décodage de codes polaires et de codes de produit concernent un décodeur (301) pour décoder un mot-code de code polaire, le mot-code de code polaire résultant du codage de données d'informations à l'aide d'un schéma de codage de code polaire. Le mot-code de code polaire comprend une pluralité de valeurs de code. Le décodeur (301) comprend un processeur (303) configuré pour sélectionner des premières valeurs de code successives pour obtenir un premier sous-mot-code et sélectionner des secondes valeurs de code successives pour obtenir un second sous-mot-code. Les secondes valeurs de code successives suivent les premières valeurs de code successives. Le processeur est en outre configuré pour agencer le premier sous-mot-code et le second sous-mot-code pour former une matrice de code de produit comprenant une première ligne de matrice avec les premières valeurs de code successives et une seconde ligne de matrice avec les secondes valeurs de code successives, une première colonne de matrice comprenant des valeurs de code du premier sous-mot-code et du second sous-mot-code, et une seconde colonne de matrice comprenant des valeurs de code du premier sous-mot-code et du second sous-mot-code. Et décoder la matrice de code de produit à l'aide d'un schéma de décodage de code de produit pour récupérer les données d'informations à partir du mot-code polaire. L'invention concerne en outre un décodeur (311) pour décoder un mot-code de code de produit.
PCT/EP2018/074798 2018-09-13 2018-09-13 Décodeurs et procédés de décodage de codes polaires et de codes de produits Ceased WO2020052770A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201880095995.0A CN112534724B (zh) 2018-09-13 2018-09-13 用于解码极化码和乘积码的解码器和方法
PCT/EP2018/074798 WO2020052770A1 (fr) 2018-09-13 2018-09-13 Décodeurs et procédés de décodage de codes polaires et de codes de produits

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2018/074798 WO2020052770A1 (fr) 2018-09-13 2018-09-13 Décodeurs et procédés de décodage de codes polaires et de codes de produits

Publications (1)

Publication Number Publication Date
WO2020052770A1 true WO2020052770A1 (fr) 2020-03-19

Family

ID=63586725

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2018/074798 Ceased WO2020052770A1 (fr) 2018-09-13 2018-09-13 Décodeurs et procédés de décodage de codes polaires et de codes de produits

Country Status (2)

Country Link
CN (1) CN112534724B (fr)
WO (1) WO2020052770A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI731696B (zh) * 2020-05-26 2021-06-21 國立臺灣大學 基於信度傳播之極化碼解碼方法
CN114285419A (zh) * 2021-12-17 2022-04-05 扬州大学 一种自适应码长低复杂度bpl译码器

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12170530B1 (en) * 2023-07-17 2024-12-17 Huawei Technologies Co., Ltd. Flexible-rate polar decoder-based communication systems and methods

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180226999A1 (en) * 2017-02-06 2018-08-09 Mitsubishi Electric Research Laboratories, Inc. Soft-Output Decoding of Codewords Encoded with Polar Code

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3229429B1 (fr) * 2016-04-08 2021-03-03 Institut Mines-Télécom Procédés et dispositifs de détection de symboles dans un système à antennes multiples
WO2017196203A1 (fr) * 2016-05-12 2017-11-16 Huawei Technologies Co., Ltd Dispositifs et procédés mettant en œuvre des codes polaires
WO2018021926A1 (fr) * 2016-07-27 2018-02-01 Huawei Technologies Co., Ltd. Décodage de codes polaires et de sous-codes polaires
CN108390740B (zh) * 2017-02-03 2021-04-09 华为技术有限公司 一种信息的传输方法、译码方法和装置
CN108390677A (zh) * 2018-03-20 2018-08-10 山东大学 一种极化码优化的编译码方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180226999A1 (en) * 2017-02-06 2018-08-09 Mitsubishi Electric Research Laboratories, Inc. Soft-Output Decoding of Codewords Encoded with Polar Code

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
E. ARIKAN: "Channel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels", IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 55, no. 7, July 2009 (2009-07-01), pages 3051, XP011262510
GABI SARKIS ET AL: "Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes", IEEE TRANSACTIONS ON COMMUNICATIONS, January 2016 (2016-01-01), New York, pages 2732 - 2745, XP055336370, Retrieved from the Internet <URL:https://arxiv.org/pdf/1507.03614v3.pdf> DOI: 10.1109/TCOMM.2016.2574996 *
KOIKE-AKINO TOSHIAKI ET AL: "Irregular Polar Turbo Product Coding for High-Throughput Optical Interface", 2018 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXPOSITION (OFC), OSA, 11 March 2018 (2018-03-11), pages 1 - 3, XP033357478 *
T. KOIKE-AKINO: "Irregular polar turbo product coding for high-throughput optical interface", OPTICAL FIBER COMMUNICATION CONFERENCE AND EXHIBITION, 2018
VANGALA HARISH ET AL: "A new multiple folded successive cancellation decoder for polar codes", 2014 IEEE INFORMATION THEORY WORKSHOP (ITW 2014), IEEE, 2 November 2014 (2014-11-02), pages 381 - 385, XP032694569, ISSN: 1662-9019, [retrieved on 20141201], DOI: 10.1109/ITW.2014.6970858 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI731696B (zh) * 2020-05-26 2021-06-21 國立臺灣大學 基於信度傳播之極化碼解碼方法
CN114285419A (zh) * 2021-12-17 2022-04-05 扬州大学 一种自适应码长低复杂度bpl译码器

Also Published As

Publication number Publication date
CN112534724B (zh) 2024-04-09
CN112534724A (zh) 2021-03-19

Similar Documents

Publication Publication Date Title
US10326478B2 (en) Apparatus and method for encoding and decoding data in twisted polar code
CN104124979B (zh) 极性码的译码方法和译码装置
Cai et al. Relaxed min-max decoder architectures for nonbinary low-density parity-check codes
US6421804B1 (en) Generating reliability values for iterative decoding of block codes
Pfister et al. Symmetric product codes
US8468438B2 (en) Method and apparatus for elementary updating a check node during decoding of a block encoded with a non-binary LDPC code
Schläfer et al. Syndrome based check node processing of high order NB-LDPC decoders
WO2020052770A1 (fr) Décodeurs et procédés de décodage de codes polaires et de codes de produits
CN116530022A (zh) 用于乘积极化码编码和解码的设备
Krainyk et al. Low-complexity high-speed soft-hard decoding for turbo-product codes
US20100185913A1 (en) Method for decoding ldpc code and the circuit thereof
Xiao et al. A low-latency and area-efficient ORBGRAND decoder for polar codes
US9037938B2 (en) Hardware architecture and implementation of low power layered multi-level LDPC decoder
CN111384972B (zh) 多进制ldpc解码算法的优化方法、装置及解码器
US11323139B2 (en) Apparatuses and methods for mapping frozen sets between polar codes and product codes
WO2019011352A1 (fr) Procédé de décodage de code d&#39;escalier et appareil de décodage de code d&#39;escalier
US8892985B2 (en) Decoding and optimized implementation of SECDED codes over GF(q)
US10516418B2 (en) Hybrid type iterative decoding method and apparatus
Simsek et al. Hardware optimization for belief propagation polar code decoder with early stopping criteria using high-speed parallel-prefix ling adder
US8091012B2 (en) System and method for decreasing decoder complexity
US8977924B2 (en) Optimized mechanism to simplify the circulant shifter and the P/Q kick out for layered LDPC decoder
Ovechkin et al. Improving performance of non-binary multithreshold decoder’s work due to concatenation
Wu et al. Scalable block-wise product BCH codes
CN117914446B (zh) 针对代数码的解码方法及系统
Dai et al. Performance and implementation of enhanced multi CRC-LSC polar codes

Legal Events

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

Ref document number: 18769684

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18769684

Country of ref document: EP

Kind code of ref document: A1