ATE523967T1 - Erzeugung einer exponententabelle für die codierung und decodierung von ldpc-codes unterschiedlicher länge - Google Patents
Erzeugung einer exponententabelle für die codierung und decodierung von ldpc-codes unterschiedlicher längeInfo
- Publication number
- ATE523967T1 ATE523967T1 AT09100070T AT09100070T ATE523967T1 AT E523967 T1 ATE523967 T1 AT E523967T1 AT 09100070 T AT09100070 T AT 09100070T AT 09100070 T AT09100070 T AT 09100070T AT E523967 T1 ATE523967 T1 AT E523967T1
- Authority
- AT
- Austria
- Prior art keywords
- sub
- matrix
- codeword
- coding
- generation
- Prior art date
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/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/033—Theoretical methods to calculate these checking 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
- 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
- H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
-
- 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/618—Shortening and extension 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/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
-
- 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/65—Purpose and implementation aspects
- H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
- H03M13/6516—Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
-
- 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/65—Purpose and implementation aspects
- H03M13/6522—Intended application, e.g. transmission or communication standard
- H03M13/6544—IEEE 802.16 (WIMAX and broadband wireless access)
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Error Detection And Correction (AREA)
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP09100070A EP2211470B1 (de) | 2009-01-26 | 2009-01-26 | Erzeugung einer Exponententabelle für die Codierung und Decodierung von LDPC-Codes unterschiedlicher Länge |
Publications (1)
Publication Number | Publication Date |
---|---|
ATE523967T1 true ATE523967T1 (de) | 2011-09-15 |
Family
ID=40374921
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
AT09100070T ATE523967T1 (de) | 2009-01-26 | 2009-01-26 | Erzeugung einer exponententabelle für die codierung und decodierung von ldpc-codes unterschiedlicher länge |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP2211470B1 (de) |
AT (1) | ATE523967T1 (de) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104202057B (zh) * | 2014-02-12 | 2019-08-16 | 中兴通讯股份有限公司 | 信息处理方法及装置 |
EP3295569A1 (de) * | 2015-05-18 | 2018-03-21 | Huawei Technologies Co. Ltd. | Multirate-ldpc-codierung und -decodierung mit unterschiedlichen codelängen mit einer multirate-exponententabelle und einem expansionsfaktor |
KR20170060562A (ko) | 2015-11-24 | 2017-06-01 | 삼성전자주식회사 | 통신 또는 방송 시스템에서 채널 부호화/복호화 방법 및 장치 |
WO2017091018A1 (en) * | 2015-11-24 | 2017-06-01 | Samsung Electronics Co., Ltd. | Method and apparatus for channel encoding/decoding in a communication or broadcasting system |
CN117749315A (zh) * | 2022-09-13 | 2024-03-22 | 华为技术有限公司 | 编码方法、译码方法、通信装置及计算机可读存储介质 |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006039801A1 (en) * | 2004-10-12 | 2006-04-20 | Nortel Networks Limited | System and method for low density parity check encoding of data |
US7581159B2 (en) * | 2004-11-23 | 2009-08-25 | Texas Instruments Incorporated | Simplified decoding using structured and punctured LDPC codes |
-
2009
- 2009-01-26 AT AT09100070T patent/ATE523967T1/de not_active IP Right Cessation
- 2009-01-26 EP EP09100070A patent/EP2211470B1/de active Active
Also Published As
Publication number | Publication date |
---|---|
EP2211470B1 (de) | 2011-09-07 |
EP2211470A1 (de) | 2010-07-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
MX2019010132A (es) | Metodo y aparato para codificacion y decodificacion de comprobacion de paridad de baja densidad. | |
ATE523967T1 (de) | Erzeugung einer exponententabelle für die codierung und decodierung von ldpc-codes unterschiedlicher länge | |
KR101211433B1 (ko) | 낮은 복잡도를 가지는 고속의 qc-ldpc 부호의 부호화 장치 및 방법 | |
GB2512533A (en) | Generating a code alphabet of symbols to generate codewords for words used with a program | |
Halbawi et al. | Balanced Reed-Solomon codes for all parameters | |
Al-seraji | On Almost Maximum Distance Separable Codes | |
Tseng et al. | Low-complexity and piecewise systematic encoding of non-full-rank QC-LDPC codes | |
Betsumiya et al. | Classification of formally self-dual even codes of lengths up to 16 | |
Qian et al. | On cyclic self-orthogonal codes over Z2m | |
Al-Seraji | Generalized of Optimal Codes | |
Urbanovich et al. | Multithreshold majority decoding of LDPC-codes | |
Ivanov et al. | The score of the minimum length of cycles in generalized quasi-cyclic regular LDPC codes | |
Zeh et al. | Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes | |
CN107592958B (zh) | 不同码长下使用一个多比率指数表和一个扩展因子的多比率的ldpc编码和解码 | |
Shiozaki et al. | Close-to-capacity performance of extended single parity check product codes | |
Russeva et al. | On binary self-dual codes of lengths 60, 62, 64 and 66 having an automorphism of order 9 | |
Mihoubi et al. | Optimal and isodual ternary cyclic codes of rate 1/2 | |
Zhu et al. | A note on negacyclic self-dual codes over Z2a | |
Lee et al. | Decoding of the triple-error-correcting binary quadratic residue codes | |
EP2159920A3 (de) | Parallele Kodierung von Quasi-Zyklischen Kodes | |
Harzalla | Binary Linear Codes and Binary Matrices | |
Amirzade et al. | An algebraic construction of QC-LDPC codes based on powers of primitive elements in a finite field and free of small ETSs | |
Anev et al. | Self–dual codes of length 78 with an automorphism of order 13 | |
Saouter et al. | A FPGA implementation of Chen's algorithm | |
Gulliver et al. | Extended Binary Linear Codes from Legendre Sequences. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
RER | Ceased as to paragraph 5 lit. 3 law introducing patent treaties |