処理中

しばらくお待ちください...

設定

設定

出願の表示

1. EP2738944 - ENCODING AND DECODING OF TAIL-BITING RATE (N-1)/N LOW-DENSITY PARITY CHECK CONVOLUTIONAL CODES (LDPC-CC)

官庁 欧州特許庁(EPO)
出願番号 12818224
出願日 24.07.2012
公開番号 2738944
公開日 04.06.2014
公報種別 B1
IPC
H03M 13/11
H電気
03基本電子回路
M符号化,復号化または符号変換一般
13誤りの検出または誤りの訂正のための符号化,復号化または符号変換;符号理論の基本的仮定;符号化の限界式;誤り確率の評価方法;通信路モデル;符号のシミュレーションまたは試験
03データ表現の冗長性に基づく誤り検出または前方向誤り訂正,すなわち,符号後が元の語より多くのデジットを含むもの
05ブロック符号を用いるもの,すなわち,事前に決めた数の検査ビットを事前に決めた数の情報ビットに付加するもの
11複数のパリティ・ビットを用いるもの
H03M 13/03
H電気
03基本電子回路
M符号化,復号化または符号変換一般
13誤りの検出または誤りの訂正のための符号化,復号化または符号変換;符号理論の基本的仮定;符号化の限界式;誤り確率の評価方法;通信路モデル;符号のシミュレーションまたは試験
03データ表現の冗長性に基づく誤り検出または前方向誤り訂正,すなわち,符号後が元の語より多くのデジットを含むもの
H03M 13/09
H電気
03基本電子回路
M符号化,復号化または符号変換一般
13誤りの検出または誤りの訂正のための符号化,復号化または符号変換;符号理論の基本的仮定;符号化の限界式;誤り確率の評価方法;通信路モデル;符号のシミュレーションまたは試験
03データ表現の冗長性に基づく誤り検出または前方向誤り訂正,すなわち,符号後が元の語より多くのデジットを含むもの
05ブロック符号を用いるもの,すなわち,事前に決めた数の検査ビットを事前に決めた数の情報ビットに付加するもの
09誤り検出のみ,例,巡回冗長検査符号,または単一パリティ・ビットを用いるもの
CPC
H03M 13/036
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
033Theoretical methods to calculate these checking codes
036Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
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/1154
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
11using multiple parity bits
1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
1148Structural properties of the code parity-check or generator matrix
1154Low-density parity-check convolutional codes [LDPC-CC]
H03M 13/118
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
11using multiple parity bits
1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
1148Structural properties of the code parity-check or generator matrix
118Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
H03M 13/611
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
61Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
611Specific encoding aspects, e.g. encoding by means of decoding
H03M 13/616
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
61Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
615Use of computational or mathematical techniques
616Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
出願人 SUN PATENT TRUST
発明者 MURAKAMI YUTAKA
指定国 (国コード)
優先権情報 2011164263 27.07.2011 JP
2011250403 16.11.2011 JP
2012004718 24.07.2012 JP
2012009456 19.01.2012 JP
発明の名称
(DE) ENCODIERUNG UND DECODIERUNG VON TAIL-BITING LOW-DENSITY PARITY CHECK CONVOLUTIONAL CODES (LDPC-CC) DER RATE (N-1)/N
(EN) ENCODING AND DECODING OF TAIL-BITING RATE (N-1)/N LOW-DENSITY PARITY CHECK CONVOLUTIONAL CODES (LDPC-CC)
(FR) CODAGE ET DÉCODAGE DE CODES DE TYPE LDPC CONVOLUTIFS (LDPC-CC) À TREILLIS CIRCULAIRE À RENDEMENT (N-1)/N
要約
(EN)
An encoding method generates an encoded sequence by performing encoding of a given coding rate according to a predetermined parity check matrix. The predetermined parity check matrix is a first parity check matrix or a second parity check matrix. The first parity check matrix corresponds to a low-density parity check (LDPC) convolutional code using a plurality of parity check polynomials. The second parity check matrix is generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix. An eth parity check polynomial that satisfies zero, of the LDPC convolutional code, is expressible by using a predetermined mathematical formula.

(FR)
La présente invention concerne un procédé de codage qui génère une séquence de codage grâce à la réalisation d'un codage à un certain taux de codage sur la base d'une matrice de contrôle de parité imposée. Cette matrice de contrôle de parité imposée est une première matrice de contrôle de parité correspondant à un code de convolution de contrôle de parité à faible densité (LDPC) qui utilise plusieurs polynômes de contrôle de parité, ou une seconde matrice de contrôle de parité générée grâce à des permutations de colonnes et/ou des permutations de rangées qui sont effectuées sur la première matrice de contrôle de parité. Le polynôme de contrôle de parité qui est conforme au eème 0 dans le code de convolution LDPC est représenté par une expression spécifique.