WO2021000531A1 - Procédé de décodage par retournement segmenté de codes polaires basé sur llr et terminal intelligent - Google Patents

Procédé de décodage par retournement segmenté de codes polaires basé sur llr et terminal intelligent Download PDF

Info

Publication number
WO2021000531A1
WO2021000531A1 PCT/CN2019/126117 CN2019126117W WO2021000531A1 WO 2021000531 A1 WO2021000531 A1 WO 2021000531A1 CN 2019126117 W CN2019126117 W CN 2019126117W WO 2021000531 A1 WO2021000531 A1 WO 2021000531A1
Authority
WO
WIPO (PCT)
Prior art keywords
decoding
llr
segment
channel
bit
Prior art date
Application number
PCT/CN2019/126117
Other languages
English (en)
Chinese (zh)
Inventor
何业军
曹安琪
张力
Original Assignee
深圳大学
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 深圳大学 filed Critical 深圳大学
Publication of WO2021000531A1 publication Critical patent/WO2021000531A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Definitions

  • the present invention relates to the technical field of channel coding in a communication system, in particular to an LLR-based decoding method for segmented flipped polarization codes, an intelligent terminal and a storage medium.
  • Polarization code is an emerging channel coding technology, and it is also the only coding scheme that can reach the Shannon limit in theory. Polarization codes are constructed on the theoretical basis of channel polarization. In the process of channel polarization, the channel capacity has shifted, some of the channel capacity becomes larger, and the other part of the channel capacity becomes smaller. When the code length tends to be infinite, some of the channel capacity is 1 and the other is 0. At this time, the low-complexity SC (successive cancellation) decoding algorithm can realize efficient and reliable transmission decoding. But for polarization codes with short and medium code lengths, not all channels are fully polarized, and the performance of the SC decoding algorithm is not ideal.
  • the SCL (SC list) algorithm improves decoding performance by retaining multiple possible decoding paths, and finally selects the most reliable decoding path for output.
  • CA-SCL CRC-aided SCL
  • CRC cyclical redundancy check
  • the path uses CRC to select the best decoding path to output.
  • the SCF (SC flip) algorithm tries to correct the wrong decoding with the help of bit flip and CRC check after the SC decoding is completed.
  • the SCA-SCL (segmented CRC-aided SCL) algorithm divides the information bits into segments, and each segment is cascaded with CRC check bits, and each segment of decoding is completed to verify one segment of the decoding. If there is a decoding error, that is, no path can pass the CRC check, the decoding is terminated in time.
  • the SCA-SCL decoding algorithm reduces the computational complexity and storage complexity, and does not lose the decoding performance of CA-SCL decoding, but the SCA-SCL decoding algorithm only performs error detection on the decoding result, but does not perform Error correction.
  • the present invention provides a segmented flipped polarized code decoding method based on LLR, an intelligent terminal and storage medium.
  • An LLR-based segmented flipped polarization code decoding method wherein the LLR-based segmented flipped polarization code decoding method includes:
  • the steps of calculating the LLR value of the information bit channel, counting the index distribution of the low-reliability channel, and determining the segment position specifically include:
  • the segment position is determined according to the index distribution of the low reliability channel, each segment is controlled to include a preset low reliability channel, and the last bit index of each segment is recorded.
  • the calculating the LLR value of the information bit channel and counting the index distribution of the low-reliability channel specifically includes:
  • the input vector is The decoder receiving vector is The log likelihood ratio of the information bit, that is, the LLR value is:
  • the channel transmission probability is the channel transmission probability.
  • the LLR value is used to measure channel transmission reliability, the larger
  • the segment flip decoding algorithm with the number of segments P and the maximum number of flips per segment is T max , there are P ⁇ T max flip opportunities;
  • the step of performing segmental encoding on the information sequence according to the segment position and sending it to the transmission channel includes:
  • the last C bit of each segment is used as the CRC check bit, and C is the CRC code word length;
  • the K-P ⁇ C bit information sequence is divided into P segments, and each segment is cascaded with CRC for error detection. After the sub-code segments are combined, polarization coding is performed, and the polarization coding sequence is sent to the transmission channel.
  • the step of performing SCL decoding on the received sequence and performing CRC check in segments specifically includes:
  • Each decoding node reserves at most L decoding paths
  • the path metric value PM When the extended path is greater than L, the path is filtered according to the path metric value, and the L paths with the smallest metric value are retained.
  • the path metric value PM When the extended path is greater than L, the path is filtered according to the path metric value, and the L paths with the smallest metric value are retained.
  • the path metric value PM When the extended path is greater than L, the path is filtered according to the path metric value, and the L paths with the smallest metric value are retained.
  • L l (u i ) is the LLR value of the l- th decoding path on channel i, and the LLR value is based on the estimated vector of path l Calculation:
  • the path is reserved to continue to the next segment of decoding, if all sub-code segments are decoded, the path is output; if no path passes the CRC check, the sub-code that fails the CRC check Segments are decoded by bit flipping.
  • the step of performing bit flipped decoding on the sub-code segments that have not passed the CRC check includes:
  • a candidate path with the smallest path metric value is selected for single-bit inversion
  • the set Flip is selected by the T max of the decoding path with the smallest
  • the step of performing bit flipped decoding on the sub-code segments that have not passed the CRC check further includes:
  • the step of continuing to the next stage of decoding or outputting the decoding result specifically includes:
  • the decoding path is retained to continue to perform SCL decoding on the next segment of codewords, and if the decoding of the information sequence is completed, the decoding path is output as the decoding result.
  • an intelligent terminal wherein the intelligent terminal includes the above-mentioned LLR-based segmented flipped polarization code decoding system, and further includes: a memory, a processor, and a memory and a processor that are stored in the memory and can be stored in the processor LLR-based segmented inverted polarization code decoding program running on the LLR, when the LLR-based segmented inverted polarization code decoding program is executed by the processor, the above-mentioned LLR-based segmented inverted polarization is realized Steps of code decoding method.
  • a storage medium wherein the storage medium stores an LLR-based segmented flipped polarization code decoding program, and the LLR-based segmented flipped polarization code decoding program is executed by a processor to achieve The steps of the LLR segmented flip polarization code decoding method.
  • the present invention performs LLR-based segmented flip decoding on polarized codes, aiming to improve the performance of polarized code CA-SCL decoding and reduce computational complexity.
  • the present invention first calculates the LLR value and counts the low-reliability channel distribution, according to the LLR Distribute the polarization code segmented encoding and decoding to avoid low-reliability channels being densely distributed in a certain segment, increasing the probability of single-bit flipping success, and then using CRC check to perform single-bit flipping decoding on the sub-code segments with decoding errors. Decoding still makes an error when the number of flips reaches the threshold, and the decoding is terminated in time to reduce unnecessary decoding calculations.
  • segment flipping decoding increases the amount of decoding calculations at most N/P bits at a time, segment flipping decoding is relatively In traditional SCF decoding, there are more flipping opportunities, but it will not bring more computational complexity.
  • the purpose of bit flipping decoding is to find and correct the first error bit in the decoding process, compared to the code length of N For polarized codes, it is easier to find the first error bit in the sub-code segment with a code length of N/P.
  • the segment flipping decoding based on LLR can improve the decoding performance of polarized codes and reduce decoding calculations. the complexity.
  • Fig. 1 is a flowchart of a preferred embodiment of the LLR-based segmented flipped polarization code decoding method of the present invention
  • FIG. 3 is a schematic diagram of the LLR-based segmented inversion decoding process in the preferred embodiment of the LLR-based segmented inversion polarization code decoding method of the present invention
  • Figure 7 is a schematic diagram of the operating environment of the preferred embodiment of the smart terminal of the present invention.
  • an LLR-based segmented flipped polarization code decoding method includes the following steps:
  • Step S10 Calculate the LLR value of the information bit channel, count the index distribution of the low-reliability channel, and determine the segment position.
  • the LLR (Log Likelihood Ratio) value of the information bit channel is calculated, and the LLR value is used to measure the channel transmission reliability and count the index distribution of the low reliability channel; according to the low reliability
  • the index distribution of the channel determines the segment position, each segment is controlled to include a preset low-reliability channel, and the last bit index of each segment is recorded.
  • the information bit length is K polarization code
  • the input vector is
  • the decoder receiving vector is The log likelihood ratio of the information bit, that is, the LLR value is:
  • the index distribution of the statistically low-reliable channel is the channel index distribution with the small absolute value of the statistical LLR .
  • the method In order to determine the segment position, the method needs to count the
  • the number of segments is P, and the maximum number of flips per segment is T max .
  • the segment flipping decoding algorithm has a total of P ⁇ T max flipping opportunities; define an unreliable set F, and the set F has the smallest number of P ⁇ T max
  • the LLR value of the information bit channel is calculated repeatedly for many times, and the average value distribution of
  • the segment position is determined according to the index distribution of the low-reliability channel, so that each segment contains T max low-reliability channel indexes, and the end index of each segment is recorded at the same time; compared with the uniform segmentation method, the segmentation method makes unreliable estimation More evenly distributed in each sub-code segment.
  • Step S20 Perform segment coding on the information sequence according to the segment position and send it to the transmission channel.
  • the last C bit of each segment is used as the CRC check bit, and C is the length of the CRC codeword;
  • the KP ⁇ C bit information sequence is divided into P segments, and each segment is cascaded for CRC.
  • polarization coding is performed after combining the sub-code segments, and the polarization coding sequence is sent to the transmission channel.
  • Step S30 Perform SCL decoding on the received sequence, and perform CRC check in segments.
  • L l (u i ) is the LLR value of the l- th decoding path on channel i. LLR value according to the estimated vector of path l Calculation:
  • a CRC check is performed. If there is a path that passes the CRC check, the path is retained to proceed to the next segment of decoding, if all sub-code segments are decoded, the path is output; if no path passes the CRC check, the segment is decoded by bit inversion.
  • Step S40 Perform bit inversion decoding on the sub-code segments that have not passed the CRC check.
  • a candidate path with the smallest path metric value is selected for single-bit flipping, and a flip set Flip is defined.
  • the set Flip is composed of T max of the selected decoding paths. With the smallest
  • flipping decoding arrange the
  • Step S50 If the flipping decoding is successful, continue to the next stage of decoding or output the decoding result, if the flipping decoding fails, then terminate the decoding and declare the decoding failure.
  • the decoding path is reserved to continue to perform SCL decoding on the next segment of codewords. If the information sequence decoding is completely completed, the decoding path is output as the decoding result; if the flipping decoding fails, Then the decoding is terminated and the decoding is declared as a failure to reduce redundant decoding calculations.
  • the unreliable set F consists of 30 with the smallest
  • the segment position is determined according to the index distribution of the low-reliability channel.
  • the last bit index of the first segment is 49, so that each segment contains 15 low-reliability channel indexes.
  • the LLR-based segmentation position is more advanced, and the low-reliability channel index is more evenly distributed in each segment, which is conducive to bit flipping decoding to successfully find the first error bit.
  • the third step LLR-based segment flipping decoding is performed on the received sequence.
  • the decoding flow chart is shown in Figure 3. First, SCL decoding is performed on the received sequence, and each decoding node reserves at most L decoding paths. When the extended path is greater than L, the path is filtered according to the path metric value, and the L paths with the smallest metric value are retained. Path metric PM:
  • L l (u i ) is the LLR value of the l- th decoding path on channel i. LLR value according to the estimated vector of path l Calculation:
  • a CRC check is performed. If there is a path that passes the CRC check, the path is reserved to continue SCL decoding, and if all sequence decoding is completed, the path is output; if no path passes the CRC check, the segment is decoded by bit inversion.
  • a candidate path with the smallest path metric value is selected for single-bit inversion. Arrange the
  • the decoding path is reserved to continue to perform SCL decoding on the next segment of codewords. If the information sequence decoding is completed, the decoding path is output as the decoding result; if the flipping decoding fails, the decoding is terminated. Code and declare the decoding failed.
  • Fig. 4 is a comparison diagram of the BLER performance of the LLR-based segmented flip decoding method of the present invention and the traditional SCF decoding, CA-SCL decoding and SCA-SCL decoding.
  • the unsegmented SCF and CA-SCL decoding both use 16-bit CRC check bits
  • the segmented SCA-SCL and the LLR-based segmented inversion decoding of the present invention both use 8-bit CRC check bits.
  • the BLER performance of the LLR-based segmented flipping decoding of the present invention is significantly improved compared to the BLER performance of other traditional decoding methods, and the decoding performance of 4 segments is better than that of 2 segments. .
  • L maximum list sizes
  • the average decoding list size is used to represent the decoding calculation complexity.
  • the size of the decoding list for completing a segment flip decoding based on LLR is:
  • k is the number of decoded segments
  • F is the number of flipping decoding times
  • L flip (j) is the size of the decoding list for the jth flipping decoding
  • L flip (j) number of bits for the jth flipping decoding/N.
  • the present invention also provides an intelligent terminal correspondingly.
  • the intelligent terminal includes a processor 10, a memory 20, and a display 30.
  • FIG. 7 only shows part of the components of the smart terminal, but it should be understood that it is not required to implement all the shown components, and more or fewer components may be implemented instead.
  • the memory 20 may be an internal storage unit of the smart terminal in some embodiments, such as a hard disk or memory of the smart terminal. In other embodiments, the memory 20 may also be an external storage device of the smart terminal, such as a plug-in hard disk equipped on the smart terminal, a smart media card (SMC), and a secure digital (Secure Digital). Digital, SD) card, flash card (Flash Card), etc. Further, the memory 20 may also include both an internal storage unit of the smart terminal and an external storage device. The memory 20 is used to store application software and various data installed on the smart terminal, such as program code for the smart terminal installed. The memory 20 can also be used to temporarily store data that has been output or will be output.
  • the LLR-based segmented flipped polarization code decoding program 40 is stored in the memory 20, and the LLR-based segmented flipped polarization code decoding program 40 can be executed by the processor 10, thereby realizing this The application is based on the LLR segmented flipped polarization code decoding method.
  • the processor 10 may be a central processing unit (CPU), a microprocessor or other data processing chip, which is used to run the program code or process data stored in the memory 20, for example Perform the LLR-based segmented flipped polarization code decoding method and so on.
  • CPU central processing unit
  • microprocessor or other data processing chip, which is used to run the program code or process data stored in the memory 20, for example Perform the LLR-based segmented flipped polarization code decoding method and so on.
  • the display 30 may be an LED display, a liquid crystal display, a touch liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, etc.
  • the display 30 is used for displaying information on the smart terminal and for displaying a visualized user interface.
  • the components 10-30 of the smart terminal communicate with each other via a system bus.
  • the present invention also provides a storage medium, wherein the storage medium stores an LLR-based segmented flipped polarization code decoding program, which is implemented when the LLR-based segmented flipped polarization code decoding program is executed by a processor
  • LLR-based segmented flipped polarization code decoding program which is implemented when the LLR-based segmented flipped polarization code decoding program is executed by a processor
  • the present invention provides an LLR segmented flipped polarization code decoding method and an intelligent terminal.
  • the method includes: calculating the LLR value of the information bit channel, counting the index distribution of the low reliability channel, and determining the segment Position; segment-encode the information sequence according to the segment position and send it to the transmission channel; perform SCL decoding on the received sequence and perform CRC check on the segment; perform bit-reversal decoding on sub-code segments that fail the CRC check; If the flipping decoding is successful, continue to the next stage of decoding or output the decoding result; if the flipping decoding fails, terminate the decoding and declare the decoding failed.
  • the LLR-based segmentation of the present invention makes low-reliability bits more evenly distributed in each segment; segment flipping decoding realizes error correction in a shorter code segment, improves the probability of error correction success and realizes multi-bit flipping; When the decoding fails, the decoding is terminated in time to reduce the redundant decoding calculation complexity.
  • the program may include the processes of the foregoing method embodiments when executed.
  • the storage medium mentioned may be a memory, a magnetic disk, an optical disk, and the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Error Detection And Correction (AREA)

Abstract

L'invention concerne un procédé de décodage par retournement segmenté de codes polaires basé sur un LLR et un terminal intelligent. Le procédé consiste : à calculer une valeur de LLR d'un canal de bits d'informations, à effectuer des statistiques sur la distribution d'indices d'un canal de faible fiabilité et à déterminer des positions de segmentation ; à effectuer un codage segmenté sur une séquence d'informations selon les positions de segmentation, puis à envoyer la séquence d'informations à un canal de transmission ; à effectuer un décodage de SCL sur la séquence reçue et à effectuer un CRC d'une manière segmentée ; à effectuer un décodage par retournement de bits sur un segment de sous-code qui ne passe pas le CRC ; et si le décodage par retournement réussit, à continuer à décoder le segment suivant ou à transmettre un résultat de décodage et si le décodage par retournement échoue, à terminer le décodage et à déclarer que le décodage a échoué. Selon le décodage segmenté à base LLR de la présente invention, un décodage par retournement multi-bits est réalisé et le taux de réussite de correction d'erreurs est amélioré ; un décodage défaillant est terminé à temps et la complexité de calcul est réduite ; et une meilleure performance de décodage peut être réalisée avec une moindre complexité de calcul.
PCT/CN2019/126117 2019-07-03 2019-12-18 Procédé de décodage par retournement segmenté de codes polaires basé sur llr et terminal intelligent WO2021000531A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910595206.6 2019-07-03
CN201910595206.6A CN110380819B (zh) 2019-07-03 2019-07-03 一种基于llr的分段翻转极化码译码方法和智能终端

Publications (1)

Publication Number Publication Date
WO2021000531A1 true WO2021000531A1 (fr) 2021-01-07

Family

ID=68251681

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/126117 WO2021000531A1 (fr) 2019-07-03 2019-12-18 Procédé de décodage par retournement segmenté de codes polaires basé sur llr et terminal intelligent

Country Status (2)

Country Link
CN (1) CN110380819B (fr)
WO (1) WO2021000531A1 (fr)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112929035A (zh) * 2021-01-17 2021-06-08 中国传媒大学 一种非二进制极化码的编码与译码方法
CN113114274A (zh) * 2021-04-16 2021-07-13 中国计量大学 一种基于分段关键集合的简化极化码连续消除列表译码器
CN113162633A (zh) * 2021-02-24 2021-07-23 Oppo广东移动通信有限公司 极化码的译码方法及装置、译码器、设备、存储介质
CN113949485A (zh) * 2021-08-31 2022-01-18 北京大学 一种区分噪声帧和极化码字帧的阈值盲检方法
CN113965292A (zh) * 2021-10-14 2022-01-21 北京航空航天大学 一种基于聚合构造的低复杂度极化码sc译码方法
CN114221664A (zh) * 2021-12-16 2022-03-22 杭州电子科技大学 低复杂度的极化码简化软消除列表译码器及译码方法
CN114422081A (zh) * 2021-12-28 2022-04-29 华南师范大学 基于crc-scl译码算法的qkd后处理系统及方法
CN114499751A (zh) * 2021-12-10 2022-05-13 北京邮电大学 基于极化aloha的列表增强译码方法和装置
CN114584152A (zh) * 2022-03-07 2022-06-03 东南大学 一种适用于极化码调制的滑动窗软串行抵消列表译码方法
CN115173996A (zh) * 2022-06-30 2022-10-11 北京神经元网络技术有限公司 一种盲检测处理方法、装置、计算机设备及存储介质
CN115529104A (zh) * 2021-06-24 2022-12-27 北京大学 基于最大互信息的极化码量化译码方法及装置
WO2023240804A1 (fr) * 2022-06-14 2023-12-21 华为技术有限公司 Procédé et appareil de traitement de données

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110380819B (zh) * 2019-07-03 2021-10-08 深圳大学 一种基于llr的分段翻转极化码译码方法和智能终端
CN110995278B (zh) * 2019-12-16 2024-01-12 山东希尔信息技术有限公司 一种改进极性码串行消除列表比特翻转译码方法及系统
CN111541517B (zh) * 2020-04-17 2022-03-25 北京交通大学 一种列表极化码传播译码方法
CN111628782B (zh) * 2020-07-03 2022-08-09 中山大学 一种分段翻转连续对消列表法的极化码译码方法及装置
CN112422135B (zh) * 2020-11-27 2024-04-16 中国计量大学 基于子矩阵校验的scan-bf提前翻转译码器
CN113179101B (zh) * 2021-02-07 2024-04-12 睿信丰空天科技(北京)股份有限公司 一种极化码的对称译码装置
CN112953560B (zh) * 2021-03-11 2022-12-23 中山大学 一种基于关键集的极化码连续消除列表翻转译码方法
CN114696953B (zh) * 2022-03-01 2023-12-12 重庆理工大学 一种自由空间光通信的信道编码和译码方法

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150092886A1 (en) * 2013-10-01 2015-04-02 Texas Instruments Incorporated Apparatus and method for supporting polar code designs
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same
CN108365921A (zh) * 2017-09-30 2018-08-03 华为技术有限公司 Ploar编码方法和编码装置、译码方法和译码装置
CN108574561A (zh) * 2017-03-14 2018-09-25 华为技术有限公司 极化码编码的方法和装置
CN109286405A (zh) * 2018-09-10 2019-01-29 山东科技大学 一种低复杂度的极化码递进式比特翻转sc译码方法
CN109660264A (zh) * 2018-12-03 2019-04-19 中国人民解放军陆军工程大学 高性能极化码译码算法
CN110380819A (zh) * 2019-07-03 2019-10-25 深圳大学 一种基于llr的分段翻转极化码译码方法和智能终端

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016220174A (ja) * 2015-05-26 2016-12-22 株式会社東芝 家電制御方法及び家電制御装置
CN108365914B (zh) * 2017-01-26 2023-04-18 华为技术有限公司 Polar码编译码方法及装置
CN109412611B (zh) * 2018-09-12 2022-06-10 珠海妙存科技有限公司 一种降低ldpc误码平层的方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150092886A1 (en) * 2013-10-01 2015-04-02 Texas Instruments Incorporated Apparatus and method for supporting polar code designs
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same
CN108574561A (zh) * 2017-03-14 2018-09-25 华为技术有限公司 极化码编码的方法和装置
CN108365921A (zh) * 2017-09-30 2018-08-03 华为技术有限公司 Ploar编码方法和编码装置、译码方法和译码装置
CN109286405A (zh) * 2018-09-10 2019-01-29 山东科技大学 一种低复杂度的极化码递进式比特翻转sc译码方法
CN109660264A (zh) * 2018-12-03 2019-04-19 中国人民解放军陆军工程大学 高性能极化码译码算法
CN110380819A (zh) * 2019-07-03 2019-10-25 深圳大学 一种基于llr的分段翻转极化码译码方法和智能终端

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112929035A (zh) * 2021-01-17 2021-06-08 中国传媒大学 一种非二进制极化码的编码与译码方法
CN113162633A (zh) * 2021-02-24 2021-07-23 Oppo广东移动通信有限公司 极化码的译码方法及装置、译码器、设备、存储介质
CN113162633B (zh) * 2021-02-24 2023-09-05 Oppo广东移动通信有限公司 极化码的译码方法及装置、译码器、设备、存储介质
CN113114274A (zh) * 2021-04-16 2021-07-13 中国计量大学 一种基于分段关键集合的简化极化码连续消除列表译码器
CN115529104A (zh) * 2021-06-24 2022-12-27 北京大学 基于最大互信息的极化码量化译码方法及装置
CN113949485A (zh) * 2021-08-31 2022-01-18 北京大学 一种区分噪声帧和极化码字帧的阈值盲检方法
CN113965292A (zh) * 2021-10-14 2022-01-21 北京航空航天大学 一种基于聚合构造的低复杂度极化码sc译码方法
CN113965292B (zh) * 2021-10-14 2023-08-29 北京航空航天大学 一种基于聚合构造的低复杂度极化码sc译码方法
CN114499751B (zh) * 2021-12-10 2023-06-30 北京邮电大学 基于极化aloha的列表增强译码方法和装置
CN114499751A (zh) * 2021-12-10 2022-05-13 北京邮电大学 基于极化aloha的列表增强译码方法和装置
CN114221664A (zh) * 2021-12-16 2022-03-22 杭州电子科技大学 低复杂度的极化码简化软消除列表译码器及译码方法
CN114422081B (zh) * 2021-12-28 2023-08-22 华南师范大学 基于crc-scl译码算法的qkd后处理系统及方法
CN114422081A (zh) * 2021-12-28 2022-04-29 华南师范大学 基于crc-scl译码算法的qkd后处理系统及方法
CN114584152A (zh) * 2022-03-07 2022-06-03 东南大学 一种适用于极化码调制的滑动窗软串行抵消列表译码方法
WO2023240804A1 (fr) * 2022-06-14 2023-12-21 华为技术有限公司 Procédé et appareil de traitement de données
CN115173996A (zh) * 2022-06-30 2022-10-11 北京神经元网络技术有限公司 一种盲检测处理方法、装置、计算机设备及存储介质
CN115173996B (zh) * 2022-06-30 2023-05-16 北京神经元网络技术有限公司 一种盲检测处理方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
CN110380819B (zh) 2021-10-08
CN110380819A (zh) 2019-10-25

Similar Documents

Publication Publication Date Title
WO2021000531A1 (fr) Procédé de décodage par retournement segmenté de codes polaires basé sur llr et terminal intelligent
US11451247B2 (en) Decoding signals by guessing noise
TWI663839B (zh) 使用硬選取硬解碼模式下的解碼器產生軟資訊的方法
US10312947B2 (en) Concatenated and sliding-window polar coding
JP4486198B2 (ja) 線形ブロック誤り訂正符号のために信頼できないワードをデコードするシステム
WO2015139160A1 (fr) Procédé de décodage à décision dure pour code ldpc de basculement de bits à seuil dynamique
TWI594583B (zh) 硬決定輸入之一般化低密度同位檢查軟解碼
US11177834B2 (en) Communication method and apparatus using polar codes
WO2020108586A1 (fr) Procédé et appareil de décodage de code polaire, décodeur multi-étage, et support de stockage
WO2021208243A1 (fr) Procédé de décodage de propagation de croyance en codes polaires basé sur un ensemble de bits à réflexions multiples
US11082069B1 (en) Decoding scheme for error correction code structure in data storage devices
US10484020B2 (en) System and method for parallel decoding of codewords sharing common data
KR20110031092A (ko) 메모리 시스템 및 메모리 시스템의 제어 방법
TW202044780A (zh) 使用於低密度奇偶檢查碼解碼器的方法及解碼器
US11086716B2 (en) Memory controller and method for decoding memory devices with early hard-decode exit
US9397706B1 (en) System and method for irregular multiple dimension decoding and encoding
TWI748739B (zh) 決定待翻轉比特位置的方法及極化碼解碼器
WO2021208244A1 (fr) Procédé de décodage de propagation de code polaire de liste
US20170161141A1 (en) Method and apparatus for correcting data in multiple ecc blocks of raid memory
US9236890B1 (en) Decoding a super-code using joint decoding of underlying component codes
CN118508976A (zh) 编码方法、译码方法、编码器、译码器及可读存储介质
CN111769839A (zh) 快速的比特翻转译码方法
KR101484066B1 (ko) 엘디피시 부호의 디코딩 방법
US9136876B1 (en) Size limited multi-dimensional decoding
US12047094B2 (en) Decoding method and decoding device

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: 19936062

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 21/04/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 19936062

Country of ref document: EP

Kind code of ref document: A1