JP2008509635A - データのエンコードおよびデコード方法および装置 - Google Patents
データのエンコードおよびデコード方法および装置 Download PDFInfo
- Publication number
- JP2008509635A JP2008509635A JP2007525672A JP2007525672A JP2008509635A JP 2008509635 A JP2008509635 A JP 2008509635A JP 2007525672 A JP2007525672 A JP 2007525672A JP 2007525672 A JP2007525672 A JP 2007525672A JP 2008509635 A JP2008509635 A JP 2008509635A
- Authority
- JP
- Japan
- Prior art keywords
- matrix
- column
- equal
- parity check
- vector
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims description 29
- 239000011159 matrix material Substances 0.000 claims abstract description 126
- 125000004122 cyclic group Chemical group 0.000 description 20
- 230000005540 biological transmission Effects 0.000 description 18
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000000593 degrading effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000017105 transposition Effects 0.000 description 1
Images
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/11—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 using multiple parity bits
-
- 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/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
- H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
- H03M13/6393—Rate compatible low-density parity check [LDPC] 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
-
- 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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
-
- 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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
- H03M13/1168—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices
-
- 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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/1174—Parity-check or generator matrices built from sub-matrices representing known block codes such as, e.g. Hamming codes, e.g. generalized LDPC 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/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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
-
- 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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
- H03M13/1185—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
-
- 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/11—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 using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
- H03M13/1185—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
- H03M13/1188—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
1.異なるzの値を用いることによって、比kb/nbの符号(kb=nb−mb)を、単一の基底行列Hbから多くの異なる情報シーケンスサイズk=z×kbについて設計することができる。
2.必要メモリがかなり減少する。構造化LDPC設計によって、記憶する必要があるのは基底行列Hbおよびその1についての順列のみであり、これに必要なメモリはかなり少ない。なぜならHbは典型的にHよりかなり小さく、順列は非常に単純だからである。
3.エンコードおよびデコードは、単一のビット毎にではなくビットのグループに対して実行することができる。例えば、z個のメッセージからなる一グループがメモリから取り出され、順序変更されて、ベクトル変数ノードとベクトルチェックノードとの間で渡されるようになる。
・z×zの全ゼロ部分行列表すべく、Hbにおける各0を−1で置換し、そして、
・Hbにおける各hij=1を循環シフトサイズp(i,j)で置換する(p(i,j)は負ではない)。
ベクトル化しないLDPC符号については、Hのパリティ部用の改良された階段構造を有するH行列は、性能を損なうことなく、有効なエンコードをもたらす。一般には、x=[s p]=[s0,s1,…,sk−1,p0,p1,…pm−1]であると仮定すると、m×nのH行列は二つの部分行列、すなわち、
基底行列Hbをmb×nbモデル行列Hbm(これはHまで展開する)に変換するために、循環シフトサイズp(i,j)はHbの各1について決定される必要がある。シフトサイズはまずH2について特定されることができる。H2セクションについてのシフトサイズが決定された後に、H1セクションのシフトサイズは、Hの全体の良好な性能を達成するように決定することができる。基底行列のH1部および基底行列のH1部(セクションHbmi)のシフトサイズは多くの異なる方法に割り当てることができる。例えば、シフトサイズについてのランダム値を選択することができ、シフトサイズが性能の顕著な低下を起こさなければ、それを受け入れることができる。過剰数の短周期循環あるいは低重みの符号語を導入した結果によって性能の低下が引き起こることがある。LDPC技術において利用可能な他の技術を用いてもよい。
もし2cエッジが長さ2cの一つの循環を基底行列Hbに形成するならば、対応する2cベクトルエッジは、展開した行列Hにおける長さ2cのz循環を形成する。それは以下の場合において、および以下の場合に限ってである。
1.H’bm2のすべての列において、二つのゼロでない部分行列が同一である。
2.hbmのwh個(奇数、wh>=3)のゼロでない部分行列は、任意のゼロでない行列であり得る一つの部分行列を除いて対になっている(すなわち、一つの部分行列は他の部分行列と等しい)。
エンコードとは、情報シーケンスsを与えられたパリティシーケンスpを決定する処理である。構造化LDPC符号をエンコードするために、各動作は単一のビットの代わりにzビットのグループに対して行われる。あるいは、ベクトル演算は用いられなくてもよく、下記の式は等価なスカラー形式で実行される。エンコードするために、sはzビットのkb=nb−mb個のグループに分割される。このグループ化されたsをuで表現することにする。
H’b2における1のシフトサイズが全ゼロである好ましい実施形態において、式(16)および(17)は式(19)および(20)として簡略化される。
符号拡張手順は、低いレートの符号に到達するために構造化符号に適用することができる。徐々に低くなるレート符号を、増加的冗長(IR)手順の連続送信において用いることができる。具体的には1番目の送信のモデル行列は下記の式で表せる。
Claims (10)
- 現在の記号セットs=(s0,…,sk−1)に基づいてパリティチェックビットp=(p0,…,pm−1)を生成する送信機を動作させる方法であって、
前記現在の記号セットs=(s0,…,sk−1)を受信する工程と、
行列Hを用いて前記パリティチェックビットを決定する工程と、
前記現在の記号セットと共に前記パリティチェックビットを送信する工程とを備え、
Hは基底行列Hbの展開であり、HbはセクションHb1およびセクションHb2を備え、Hb2は2より大きい奇数の重みを有する列hbを有する第一の部分と、行iと列jが、i=jについては1に等しく、i=j+1については1に等しく、他の位置については0に等しい行列要素を備える第二の部分H’b2とを備え、前記基底行列Hbの展開は、前記第二の部分H’b2の各列における1については同一部分行列を用い、hbの偶数個の1については対になった部分行列を用いる前記方法。 - Hbは、Hbの各エントリをサイズz×zの部分行列で置換することによって展開されてHを生成することを特徴とする請求項1に記載の方法。
- Hbは、Hbの各ゼロ要素をサイズz×zのゼロ部分行列で置換することによって展開されてHを生成することを特徴とする請求項1に記載の方法。
- Hbは、Hbの各非ゼロ要素を非ゼロ部分行列で置換することによって展開されてHを生成することを特徴とする請求項1に記載の方法。
- HbはHbの各非ゼロ要素を非ゼロ順列部分行列で置換することによって展開されてHを生成することを特徴とする請求項1に記載の方法。
- 行列Hを記憶する記憶手段と、
行列Hを用いてパリティチェックビットを決定するマイクロプロセッサと、
前記パリティチェックビットを送信する送信機とを備え、
Hは基底行列Hbの展開であり、HbはセクションHb1およびセクションHb2を備え、Hb2は2より大きい奇数の重みを有する列hbを有する第一の部分と、行iと列jが、i=jについては1に等しく、i=j+1については1に等しく、他の位置については0に等しい行列要素を備える第二の部分H’b2とを備え、
二つの同一部分行列がH’b2のすべての列における1を展開させるのに用いられ、対になった部分行列がhbにおける偶数個の1を展開するのに用いられることを特徴とする装置。 - 行列Hを記憶する記憶手段と、
信号ベクトルy=(y0…Yn−1)を受信する受信機と、
行列Hを用いて現在の記号セット(s0,…,sk−1)を決定するマイクロプロセッサとを備え、
Hは基底行列Hbの展開であり、HbはセクションHb1およびセクションHb2を備え、Hb2は2より大きい奇数の重みを有する列hbを有する第一の部分と、行iと列jが、i=jについては1に等しく、i=j+1については1に等しく、他の位置については0に等しい行列要素を備える第二の部分H’b2とを備え、
二つの同一部分行列がH’b2のすべての列における1を展開させるのに用いられ、対になった部分行列がhbにおける偶数個の1を展開するのに用いられることを特徴とする装置。
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US60000504P | 2004-08-09 | 2004-08-09 | |
US11/004,359 US7143333B2 (en) | 2004-08-09 | 2004-12-03 | Method and apparatus for encoding and decoding data |
PCT/US2005/027782 WO2006020495A1 (en) | 2004-08-09 | 2005-08-03 | Method and apparatus for encoding and decoding data |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2008509635A true JP2008509635A (ja) | 2008-03-27 |
JP4516602B2 JP4516602B2 (ja) | 2010-08-04 |
Family
ID=35758925
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2007525672A Active JP4516602B2 (ja) | 2004-08-09 | 2005-08-03 | データのエンコードおよびデコード方法および装置 |
Country Status (10)
Country | Link |
---|---|
US (1) | US7143333B2 (ja) |
EP (2) | EP1790081A4 (ja) |
JP (1) | JP4516602B2 (ja) |
KR (1) | KR100884698B1 (ja) |
CN (1) | CN101032082B (ja) |
BR (1) | BRPI0514179B1 (ja) |
ES (1) | ES2421942T3 (ja) |
PL (1) | PL2387157T3 (ja) |
RU (1) | RU2370886C2 (ja) |
WO (1) | WO2006020495A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4820368B2 (ja) * | 2004-09-17 | 2011-11-24 | エルジー エレクトロニクス インコーポレイティド | Ldpcコードを用いた符号化及び復号化方法 |
JP4822452B2 (ja) * | 2004-09-17 | 2011-11-24 | エルジー エレクトロニクス インコーポレイティド | Ldpcコードを用いた符号化または復号化方法及びその装置 |
Families Citing this family (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100906474B1 (ko) * | 2003-01-29 | 2009-07-08 | 삼성전자주식회사 | 저밀도 부가정보 발생용 매트릭스를 이용한 에러 정정방법 및그 장치 |
US7581157B2 (en) | 2004-06-24 | 2009-08-25 | Lg Electronics Inc. | Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system |
WO2006055086A1 (en) * | 2004-10-01 | 2006-05-26 | Thomson Licensing | A low density parity check (ldpc) decoder |
WO2006068435A2 (en) * | 2004-12-22 | 2006-06-29 | Lg Electronics Inc. | Apparatus and method for decoding using channel code |
CN100486150C (zh) * | 2005-01-23 | 2009-05-06 | 中兴通讯股份有限公司 | 基于非正则低密度奇偶校验码的编译码器及其生成方法 |
US20070180344A1 (en) * | 2006-01-31 | 2007-08-02 | Jacobsen Eric A | Techniques for low density parity check for forward error correction in high-data rate transmission |
US7941737B2 (en) * | 2006-04-19 | 2011-05-10 | Tata Consultancy Services Limited | Low density parity check code decoder |
KR101119111B1 (ko) * | 2006-05-04 | 2012-03-16 | 엘지전자 주식회사 | Ldpc 부호를 이용한 데이터 재전송 방법 |
KR101227514B1 (ko) | 2007-03-15 | 2013-01-31 | 엘지전자 주식회사 | Ldpc 부호화 및 복호화를 위한 모델 행렬을 구성하는방법 |
US8418023B2 (en) | 2007-05-01 | 2013-04-09 | The Texas A&M University System | Low density parity check decoder for irregular LDPC codes |
US20080320374A1 (en) * | 2007-06-22 | 2008-12-25 | Legend Silicon Corp. | Method and apparatus for decoding a ldpc code |
JP4823176B2 (ja) | 2007-08-31 | 2011-11-24 | パナソニック株式会社 | 復号方法及び復号装置 |
EP2223431A4 (en) * | 2008-08-15 | 2010-09-01 | Lsi Corp | DECODING LIST OF CODED WORDS CLOSE IN RAM MEMORY |
CN102077173B (zh) | 2009-04-21 | 2015-06-24 | 艾格瑞系统有限责任公司 | 利用写入验证减轻代码的误码平层 |
US8392789B2 (en) * | 2009-07-28 | 2013-03-05 | Texas Instruments Incorporated | Method and system for decoding low density parity check codes |
US8464142B2 (en) | 2010-04-23 | 2013-06-11 | Lsi Corporation | Error-correction decoder employing extrinsic message averaging |
US8499226B2 (en) | 2010-06-29 | 2013-07-30 | Lsi Corporation | Multi-mode layered decoding |
US8458555B2 (en) | 2010-06-30 | 2013-06-04 | Lsi Corporation | Breaking trapping sets using targeted bit adjustment |
US8504900B2 (en) | 2010-07-02 | 2013-08-06 | Lsi Corporation | On-line discovery and filtering of trapping sets |
US8768990B2 (en) | 2011-11-11 | 2014-07-01 | Lsi Corporation | Reconfigurable cyclic shifter arrangement |
US8977937B2 (en) * | 2012-03-16 | 2015-03-10 | Lsi Corporation | Systems and methods for compression driven variable rate decoding in a data processing system |
RU2012146685A (ru) | 2012-11-01 | 2014-05-10 | ЭлЭсАй Корпорейшн | База данных наборов-ловушек для декодера на основе разреженного контроля четности |
US9203440B1 (en) | 2013-01-29 | 2015-12-01 | Xilinx, Inc. | Matrix expansion |
US9083383B1 (en) * | 2013-01-29 | 2015-07-14 | Xilinx, Inc. | Parity check matrix |
WO2014127129A1 (en) | 2013-02-13 | 2014-08-21 | Qualcomm Incorporated | Ldpc design using quasi-cyclic constructions and puncturing for high rate, high parallelism, and low error floor |
CN106201781B (zh) * | 2016-07-11 | 2019-02-26 | 华侨大学 | 一种基于右边正则纠删码的云数据存储方法 |
US10289348B2 (en) * | 2016-12-30 | 2019-05-14 | Western Digital Technologies, Inc. | Tapered variable node memory |
WO2018171043A1 (zh) | 2017-03-24 | 2018-09-27 | 中兴通讯股份有限公司 | 一种准循环低密度奇偶校验编码处理方法及装置 |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4564944A (en) * | 1983-12-30 | 1986-01-14 | International Business Machines Corporation | Error correcting scheme |
JPS6250943A (ja) * | 1985-08-30 | 1987-03-05 | Hitachi Ltd | 記憶装置 |
KR20030036227A (ko) * | 2000-06-16 | 2003-05-09 | 어웨어, 인크. | Ldpc 코드형 변조를 위한 시스템 및 방법 |
US6567465B2 (en) * | 2001-05-21 | 2003-05-20 | Pc Tel Inc. | DSL modem utilizing low density parity check codes |
US6948109B2 (en) * | 2001-10-24 | 2005-09-20 | Vitesse Semiconductor Corporation | Low-density parity check forward error correction |
WO2004006443A1 (en) * | 2002-07-03 | 2004-01-15 | Hughes Electronics Corporation | Bit-interleaved coded modulation using low density parity check (ldpc) codes |
AU2002364182A1 (en) * | 2002-08-20 | 2004-03-11 | Flarion Technologies, Inc. | Methods and apparatus for encoding ldpc codes |
US6785863B2 (en) * | 2002-09-18 | 2004-08-31 | Motorola, Inc. | Method and apparatus for generating parity-check bits from a symbol set |
KR20040033554A (ko) * | 2002-10-15 | 2004-04-28 | 삼성전자주식회사 | 에러 정정 부호화 장치 및 그 방법 |
KR20040036460A (ko) * | 2002-10-26 | 2004-04-30 | 삼성전자주식회사 | Ldpc 복호화 장치 및 그 방법 |
US7702986B2 (en) * | 2002-11-18 | 2010-04-20 | Qualcomm Incorporated | Rate-compatible LDPC codes |
KR100809619B1 (ko) * | 2003-08-26 | 2008-03-05 | 삼성전자주식회사 | 이동 통신 시스템에서 블록 저밀도 패러티 검사 부호부호화/복호 장치 및 방법 |
-
2004
- 2004-12-03 US US11/004,359 patent/US7143333B2/en active Active
-
2005
- 2005-08-03 KR KR1020077003244A patent/KR100884698B1/ko active IP Right Grant
- 2005-08-03 PL PL11177322T patent/PL2387157T3/pl unknown
- 2005-08-03 EP EP05778444A patent/EP1790081A4/en not_active Ceased
- 2005-08-03 BR BRPI0514179-6A patent/BRPI0514179B1/pt active IP Right Grant
- 2005-08-03 WO PCT/US2005/027782 patent/WO2006020495A1/en active Application Filing
- 2005-08-03 EP EP11177322.2A patent/EP2387157B1/en active Active
- 2005-08-03 CN CN2005800269144A patent/CN101032082B/zh active Active
- 2005-08-03 RU RU2007107953/09A patent/RU2370886C2/ru active
- 2005-08-03 JP JP2007525672A patent/JP4516602B2/ja active Active
- 2005-08-03 ES ES11177322T patent/ES2421942T3/es active Active
Non-Patent Citations (2)
Title |
---|
JPN6009024383, Brian Classon et al., "Low−complexity LDPC coding for OFDMA PHY", IEEE C802.16e−04/101r2, IEEE 802.16 Broadband Wireless Access Working Group, 20040518 * |
JPN6009024386, Panyuh Joo et al., "LDPC coding for OFDMA PHY", IEEE C802.16d−04/86r1, IEEE 802.16 Broadband Wireless Access Working Group, 20040501 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4820368B2 (ja) * | 2004-09-17 | 2011-11-24 | エルジー エレクトロニクス インコーポレイティド | Ldpcコードを用いた符号化及び復号化方法 |
JP4822452B2 (ja) * | 2004-09-17 | 2011-11-24 | エルジー エレクトロニクス インコーポレイティド | Ldpcコードを用いた符号化または復号化方法及びその装置 |
Also Published As
Publication number | Publication date |
---|---|
EP2387157A1 (en) | 2011-11-16 |
CN101032082B (zh) | 2010-09-15 |
EP1790081A4 (en) | 2009-06-03 |
RU2007107953A (ru) | 2008-09-20 |
CN101032082A (zh) | 2007-09-05 |
KR20070035072A (ko) | 2007-03-29 |
EP1790081A1 (en) | 2007-05-30 |
KR100884698B1 (ko) | 2009-02-19 |
BRPI0514179A (pt) | 2008-06-03 |
BRPI0514179B1 (pt) | 2018-01-23 |
US20060031744A1 (en) | 2006-02-09 |
EP2387157B1 (en) | 2013-07-10 |
JP4516602B2 (ja) | 2010-08-04 |
WO2006020495A1 (en) | 2006-02-23 |
US7143333B2 (en) | 2006-11-28 |
PL2387157T3 (pl) | 2013-12-31 |
RU2370886C2 (ru) | 2009-10-20 |
ES2421942T3 (es) | 2013-09-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4516602B2 (ja) | データのエンコードおよびデコード方法および装置 | |
US7343548B2 (en) | Method and apparatus for encoding and decoding data | |
US7395494B2 (en) | Apparatus for encoding and decoding of low-density parity-check codes, and method thereof | |
JP4602406B2 (ja) | データをエンコード及びデコードするための方法並びに装置 | |
US7730377B2 (en) | Layered decoding of low density parity check (LDPC) codes | |
US7203897B2 (en) | Method and apparatus for encoding and decoding data | |
US7493548B2 (en) | Method and apparatus for encoding and decoding data | |
KR101227264B1 (ko) | Ldpc 코드용 디코더 | |
KR101405962B1 (ko) | Ldpc 코드를 이용한 복호화 방법 | |
US20040221223A1 (en) | Apparatus and method for encoding a low density parity check code | |
KR100861674B1 (ko) | 송신기 및 수신기를 동작시키는 방법, 및 데이터를 엔코딩 및 디코딩하는 장치 | |
US20090019333A1 (en) | Generation of parity-check matrices | |
US20130086456A1 (en) | System and Method for Determining Quasi-Cyclic Low-Density Parity-Check Codes Having High Girth | |
JP4832447B2 (ja) | チャネルコードを用いた復号化装置及び方法 | |
KR100550101B1 (ko) | 저밀도 패리티 검사 부호의 부호화와 복호 장치 및 그방법 | |
RU2365034C2 (ru) | Способ и устройство для кодирования и декодирования данных |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20090526 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20090826 |
|
TRDD | Decision of grant or rejection written | ||
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20100511 |
|
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20100514 |
|
R150 | Certificate of patent or registration of utility model |
Ref document number: 4516602 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R150 Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130521 Year of fee payment: 3 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130521 Year of fee payment: 3 |
|
S111 | Request for change of ownership or part of ownership |
Free format text: JAPANESE INTERMEDIATE CODE: R313111 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130521 Year of fee payment: 3 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
S533 | Written request for registration of change of name |
Free format text: JAPANESE INTERMEDIATE CODE: R313533 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130521 Year of fee payment: 3 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20130521 Year of fee payment: 3 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
S111 | Request for change of ownership or part of ownership |
Free format text: JAPANESE INTERMEDIATE CODE: R313113 |
|
S531 | Written request for registration of change of domicile |
Free format text: JAPANESE INTERMEDIATE CODE: R313531 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |