Processing

Please wait...

Settings

Settings

Goto Application

1. WO2019042271 - POLARIZATION CODE DECODING METHOD, DECODER AND DECODING DEVICE

Publication Number WO/2019/042271
Publication Date 07.03.2019
International Application No. PCT/CN2018/102647
International Filing Date 28.08.2018
IPC
H03M 13/09 2006.01
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
09Error detection only, e.g. using cyclic redundancy check codes or single parity bit
H03M 13/13 2006.01
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
CPC
H03M 13/09
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
H03M 13/13
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
H03M 13/39
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
H03M 13/3927
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
3905Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
3927Log-Likelihood Ratio [LLR] computation by combination of forward and backward metrics into LLRs
Applicants
  • 华为技术有限公司 HUAWEI TECHNOLOGIES CO., LTD. [CN]/[CN]
Inventors
  • 杜政 DU, Zheng
  • 郑征 ZHENG, Zheng
  • 张亮 ZHANG, Liang
  • 郭晗 GUO, Han
  • 张涛 ZHANG, Tao
Agents
  • 北京同立钧成知识产权代理有限公司 LEADER PATENT & TRADEMARK FIRM
Priority Data
201710758809.429.08.2017CN
Publication Language Chinese (ZH)
Filing Language Chinese (ZH)
Designated States
Title
(EN) POLARIZATION CODE DECODING METHOD, DECODER AND DECODING DEVICE
(FR) PROCÉDÉ DE DÉCODAGE DE CODE DE POLARISATION, DÉCODEUR ET DISPOSITIF DE DÉCODAGE
(ZH) 极化码的译码方法、译码器及译码设备
Abstract
(EN)
Provided in the present application are a method, a decoder and a decoding device for a polarization code. The method comprises: obtaining M log likelihood ratio values corresponding to each first decoded sequence in a current level of decoding, according to L first decoded sequences obtained by an upper level decoding; for any first decoded sequence, determining L optimal decoding paths according to the M log likelihood ratio values corresponding to the first decoded sequence in the current level of decoding, wherein the first decoded sequence corresponds to 2M decoding paths in the current level of decoding, and the L optimal decoding paths are decoding paths whose branch metrics are smaller than the branch metrics of other coding paths in the 2M coding paths, each branch metric being determined on the basis of M log likelihood ratio values; and for the L first decoded sequences, determining L second decoded sequences corresponding to the current level of decoding in the L×L optimal decoding paths. With the method of the application, the decoding efficiency can be improved without increasing the decoding complexity.
(FR)
La présente invention concerne un procédé, un décodeur et un dispositif de décodage pour un code de polarisation. Le procédé comprend : obtention de M valeurs de logarithme du rapport de vraisemblance correspondant à chaque première séquence décodée dans un niveau de décodage actuel, selon L premières séquences décodées obtenues par un décodage de niveau supérieur ; pour toute première séquence décodée, détermination de L chemins de décodage optimaux selon les M valeurs de logarithme du rapport de vraisemblance correspondant à la première séquence décodée dans le niveau de décodage actuel, la première séquence décodée correspondant à 2M chemins de décodage dans le niveau de décodage actuel et les L chemins de décodage optimaux étant des chemins de décodage dont les indices de mesure de branche sont plus petits que les indices de mesure de branche d'autres chemins de codage dans les 2M chemins de codage, chaque indice de mesure de branche étant déterminé sur la base de M valeurs de logarithme du rapport de vraisemblance ; et pour les L premières séquences décodées, détermination de L deuxièmes séquences décodées correspondant au niveau actuel de décodage dans les L×L chemins de décodage optimaux. Le procédé selon l'invention permet d'améliorer l'efficacité de décodage sans accroître la complexité de décodage.
(ZH)
本申请提供一种极化码的译码方法、译码器及译码设备,该方法包括:根据上一级译码得到的L条第一译码后序列,获取每条第一译码后序列在本级译码中对应的M个对数似然比值;针对任一第一译码后序列,根据第一译码后序列在本级译码中对应的M个对数似然比值,确定L条最优译码路径;其中,第一译码后序列在本级译码中对应2M个译码路径,L条最优译码路径为2M个译码路径中分支度量小于其它译码路径的分支度量的译码路径,各分支度量是根据M个对数似然比值确定的;针对L条第一译码后序列,在L×L条最优译码路径中确定本级译码对应的L条第二译码后序列。本申请在不增加译码复杂度的基础上,可以提高译码效率。
Also published as
Latest bibliographic data on file with the International Bureau