JP2012099955A - 復号装置および復号方法 - Google Patents
復号装置および復号方法 Download PDFInfo
- Publication number
- JP2012099955A JP2012099955A JP2010244519A JP2010244519A JP2012099955A JP 2012099955 A JP2012099955 A JP 2012099955A JP 2010244519 A JP2010244519 A JP 2010244519A JP 2010244519 A JP2010244519 A JP 2010244519A JP 2012099955 A JP2012099955 A JP 2012099955A
- Authority
- JP
- Japan
- Prior art keywords
- value ratio
- matrix
- unit
- node processing
- row
- 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
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/07—Arithmetic 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/1105—Decoding
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
- H03M13/1117—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule
-
- 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/1105—Decoding
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
- H03M13/1117—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule
- H03M13/112—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule with correction functions for the min-sum rule, e.g. using an offset or a scaling factor
-
- 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/1105—Decoding
- H03M13/1131—Scheduling of bit node or check node processing
- H03M13/1137—Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel
-
- 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/1105—Decoding
- H03M13/1131—Scheduling of bit node or check node processing
- H03M13/114—Shuffled, staggered, layered or turbo decoding schedules
-
- 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/1162—Array based LDPC codes, e.g. array 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
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3905—Maximum 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
- H03M13/3911—Correction factor, e.g. approximations of the exp(1+x) function
-
- 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/6577—Representation or format of variables, register sizes or word-lengths and quantization
- H03M13/658—Scaling by multiplication or division
-
- 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/6577—Representation or format of variables, register sizes or word-lengths and quantization
- H03M13/6583—Normalization other than scaling, e.g. by subtraction
-
- 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
- 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
-
- 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2906—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
【解決手段】チェックノード処理部56は、入力したデータに対して、パリティ検査行列の行ごとに、事前値比をもとに外部値比を更新する。特定部60は、更新した外部値比に対応した要素であって、かつパリティ検査行列の行と列によって特定される要素から、同一列で異なった行の新たな要素を特定する。特定部60は、新たな要素として、同一列中に含まれる複数の要素のうち、チェックノード処理部56において次に更新がなされる要素を特定する。変数ノード処理部58は、チェックノード処理部56における行ごとの更新が終了すると、特定した新たな要素に対して、外部値比をもとに事前値比を更新する。チェックノード処理部56と変数ノード処理部58とは、交互に繰り返して処理を実行する。
【選択図】図3
Description
本発明を具体的に説明する前に、まず概要を述べる。本発明の実施例1は、LDPC符号化を実行する送信装置と、送信装置において符号化されたデータ(以下、「符号化データ」という)に対して検査行列をもとに繰り返し復号を実行する受信装置とを含む通信システムに関する。特に、受信装置は、min−sum復号において、shuffled復号も実行する。ここで、min−sum復号は、sum−product復号を簡略化した復号方法である。min−sum復号は、複雑な関数を用いることなく、比較演算、和演算等の簡単な処理だけでチェックノード処理を実行する。一方、前述のごとく、shuffled復号は、検査行列の1行に対するチェックノード処理が完了すると、変数ノード処理を実行する。しかしながら、変数ノード処理を実行すべき列には、複数の要素が含まれるので、処理量が増加する。これに対応するために、本実施例に係る通信システム、特に受信装置は、次の処理を実行する。
1.初期化:事前値比を初期化し、最大復号繰り返し回数を設定する。
2.チェックノード処理:検査行列の行方向に対して外部値比を更新する。
3.変数ノード処理:検査行列の列方向に対して事前値比を更新する。
4.一時推定語を計算する。
r=floor{(m=0)/(B=5)}+1=1・・・(5)
(floorは整数以下切捨て演算を示す。)
例えば、特定部60は、行番号テーブルのうちの列番号n={0,5,10,15,20,25}に対して、行インデックスrが1に対応した部分を抽出することによって、m={5,9,8,7,6,5}を特定する。すなわち、r=1より、1行目のチェックノード処理を行った後には(m、n)が、(5,0)、(9,5)、(8,10)、(7,15)、(6,20)、(5、25)と示される要素が特定される。
次に、本発明の実施例2を説明する。本発明の実施例2は、実施例1と同様に、min−sum復号において、shuffled復号も実行する受信装置に関する。実施例1における検査行列では、各行に対する行重みが等しい。一方、実施例2における検査行列では、各行に対する行重みが等しくない。この場合、チェックノード処理の後、新たな要素を特定する際に、同一列内に「1」の要素が存在しないことがありえる。そのような状況においても、shuffled復号を続行するために、実施例に係る受信装置は、同一列内に「1」の要素が存在しない場合に、当該列内の特定を停止し、他の列における変数ノード処理のみを実行する。実施例2に係る通信システム100は、図1と同様のタイプであり、復号部28は、図3と同様のタイプである。ここでは、差異を中心に説明する。
Claims (6)
- 符号化がなされたデータを入力する入力部と、
前記入力部において入力したデータに対して、パリティ検査行列の行ごとに、事前値比をもとに外部値比を更新するチェックノード処理部と、
前記チェックノード処理部において更新した外部値比に対応した要素であって、かつパリティ検査行列の行と列によって特定される要素から、同一列で異なった行の新たな要素を特定する特定部と、
前記チェックノード処理部における行ごとの更新が終了すると、前記特定部において特定した新たな要素に対して、外部値比をもとに事前値比を更新する変数ノード処理部とを備え、
前記チェックノード処理部と前記変数ノード処理部とは、交互に繰り返して処理を実行し、
前記特定部は、新たな要素として、同一列中に含まれる複数の要素のうち、前記チェックノード処理部において次に更新がなされる要素を特定することを特徴とする復号装置。 - 前記チェックノード処理部において使用されるパリティ検査行列では、単位行列あるいは単位行列の巡回シフト行列によって構成される基本行列が行方向および列方向に複数配置されており、
前記特定部は、パリティ検査行列の列方向において、前記チェックノード処理部において更新した外部値比に対応した要素が含まれた基本行列とは異なった基本行列に含まれた新たな要素を特定することを特徴とする請求項1に記載の復号装置。 - 前記チェックノード処理部において使用されるパリティ検査行列に配置された基本行列は、零行列によっても構成され、
前記特定部は、前記チェックノード処理部において更新した外部値比に対応した要素が含まれた基本行列とは異なった基本行列が零行列であった場合、新たな要素の特定を停止することを特徴とする請求項2に記載の復号装置。 - 符号化がなされたデータを入力するステップと、
入力したデータに対して、パリティ検査行列の行ごとに、事前値比をもとに外部値比を更新するステップと、
更新した外部値比に対応した要素であって、かつパリティ検査行列の行と列によって特定される要素から、同一列で異なった行の新たな要素を特定するステップと、
前記事前値比をもとに外部値比を更新するステップにおける行ごとの更新が終了すると、特定した新たな要素に対して、外部値比をもとに事前値比を更新するステップとを備え、
前記事前値比をもとに外部値比を更新するステップと前記外部値比をもとに事前値比を更新するステップとは、交互に繰り返して処理を実行し、
前記特定するステップは、新たな要素として、同一列中に含まれる複数の要素のうち、前記事前値比をもとに外部値比を更新するステップにおいて次に更新がなされる要素を特定することを特徴とする復号方法。 - 前記事前値比をもとに外部値比を更新するステップにおいて使用されるパリティ検査行列では、単位行列あるいは単位行列の巡回シフト行列によって構成される基本行列が行方向および列方向に複数配置されており、
前記特定するステップは、パリティ検査行列の列方向において、更新した外部値比に対応した要素が含まれた基本行列とは異なった基本行列に含まれた新たな要素を特定することを特徴とする請求項4に記載の復号方法。 - 前記事前値比をもとに外部値比を更新するステップにおいて使用されるパリティ検査行列に配置された基本行列は、零行列によっても構成され、
前記特定するステップは、更新した外部値比に対応した要素が含まれた基本行列とは異なった基本行列が零行列であった場合、新たな要素の特定を停止することを特徴とする請求項5に記載の復号方法。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2010244519A JP5310701B2 (ja) | 2010-10-29 | 2010-10-29 | 復号装置および復号方法 |
CN201180052487.2A CN103190080B (zh) | 2010-10-29 | 2011-10-28 | 解码装置及解码方法 |
PCT/JP2011/006039 WO2012056713A1 (ja) | 2010-10-29 | 2011-10-28 | 復号装置および復号方法 |
US13/871,901 US9026880B2 (en) | 2010-10-29 | 2013-04-26 | Decoding apparatus and decoding method for decoding LDPC-encoded data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2010244519A JP5310701B2 (ja) | 2010-10-29 | 2010-10-29 | 復号装置および復号方法 |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2012099955A true JP2012099955A (ja) | 2012-05-24 |
JP5310701B2 JP5310701B2 (ja) | 2013-10-09 |
Family
ID=45993457
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2010244519A Active JP5310701B2 (ja) | 2010-10-29 | 2010-10-29 | 復号装置および復号方法 |
Country Status (4)
Country | Link |
---|---|
US (1) | US9026880B2 (ja) |
JP (1) | JP5310701B2 (ja) |
CN (1) | CN103190080B (ja) |
WO (1) | WO2012056713A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2012080280A (ja) * | 2010-09-30 | 2012-04-19 | Jvc Kenwood Corp | 復号装置および復号方法 |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102014215478B4 (de) * | 2014-08-05 | 2019-06-13 | Deutsches Zentrum für Luft- und Raumfahrt e.V. | Verfahren zum Übertragen von Daten |
CN105846830B (zh) * | 2015-01-14 | 2019-07-30 | 北京航空航天大学 | 数据处理装置 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006059688A1 (ja) * | 2004-12-02 | 2006-06-08 | Mitsubishi Denki Kabushiki Kaisha | 復号装置及び通信装置 |
JP2010245736A (ja) * | 2009-04-03 | 2010-10-28 | Mitsubishi Electric Corp | 復号装置および復号方法 |
Family Cites Families (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7415079B2 (en) * | 2000-09-12 | 2008-08-19 | Broadcom Corporation | Decoder design adaptable to decode coded signals using min* or max* processing |
US7139959B2 (en) * | 2003-03-24 | 2006-11-21 | Texas Instruments Incorporated | Layered low density parity check decoding for digital communications |
US7730377B2 (en) * | 2004-07-22 | 2010-06-01 | Texas Instruments Incorporated | Layered decoding of low density parity check (LDPC) codes |
KR100703271B1 (ko) * | 2004-11-23 | 2007-04-03 | 삼성전자주식회사 | 통합노드 프로세싱을 이용한 저밀도 패리티 검사 코드복호 방법 및 장치 |
CN100583651C (zh) * | 2004-12-22 | 2010-01-20 | Lg电子株式会社 | 用于使用信道代码解码的装置和方法 |
JP4519694B2 (ja) | 2005-03-29 | 2010-08-04 | 財団法人北九州産業学術推進機構 | Ldpc符号検出装置及びldpc符号検出方法 |
KR101021465B1 (ko) * | 2005-10-26 | 2011-03-15 | 삼성전자주식회사 | 저밀도 패리티 검사 코드를 사용하는 통신 시스템에서 신호수신 장치 및 방법 |
US8151161B2 (en) * | 2005-12-27 | 2012-04-03 | Lg Electronics Inc. | Apparatus and method for decoding using channel code |
US7647548B2 (en) * | 2006-07-31 | 2010-01-12 | Agere Systems Inc. | Methods and apparatus for low-density parity check decoding using hardware-sharing and serial sum-product architecture |
US7644339B2 (en) * | 2006-10-02 | 2010-01-05 | Broadcom Corporation | Overlapping sub-matrix based LDPC (low density parity check) decoder |
JP5507813B2 (ja) * | 2007-02-16 | 2014-05-28 | パナソニック株式会社 | 送信装置及び受信装置 |
US20080320374A1 (en) * | 2007-06-22 | 2008-12-25 | Legend Silicon Corp. | Method and apparatus for decoding a ldpc code |
US20090070659A1 (en) * | 2007-09-11 | 2009-03-12 | Legend Silicon Corp. | Ldpc decoder with an improved llr update method using a set of relative values free from a shifting action |
US8429483B1 (en) * | 2007-12-12 | 2013-04-23 | Marvell International Ltd. | Edge-based decoders for low-density parity-check codes |
US8291292B1 (en) * | 2008-01-09 | 2012-10-16 | Marvell International Ltd. | Optimizing error floor performance of finite-precision layered decoders of low-density parity-check (LDPC) codes |
WO2010019169A1 (en) * | 2008-08-15 | 2010-02-18 | Lsi Corporation | Rom list-decoding of near codewords |
US8161345B2 (en) * | 2008-10-29 | 2012-04-17 | Agere Systems Inc. | LDPC decoders using fixed and adjustable permutators |
US9356623B2 (en) * | 2008-11-26 | 2016-05-31 | Avago Technologies General Ip (Singapore) Pte. Ltd. | LDPC decoder variable node units having fewer adder stages |
WO2010073570A1 (ja) * | 2008-12-26 | 2010-07-01 | パナソニック株式会社 | 符号化方法、符号化器及び復号器 |
US8464121B2 (en) * | 2009-01-07 | 2013-06-11 | Intel Corporation | LDPC codes with small amount of wiring |
US8578256B2 (en) * | 2009-04-22 | 2013-11-05 | Agere Systems Llc | Low-latency decoder |
US8438461B2 (en) * | 2009-10-12 | 2013-05-07 | Marvell World Trade Ltd. | Power consumption in LDPC decoder for low-power applications |
US8572463B2 (en) * | 2010-02-01 | 2013-10-29 | Sk Hynix Memory Solutions Inc. | Quasi-cyclic LDPC encoding and decoding for non-integer multiples of circulant size |
US8924812B2 (en) * | 2010-04-08 | 2014-12-30 | Marvell World Trade Ltd. | Non-binary LDPC code decoder |
US8464142B2 (en) * | 2010-04-23 | 2013-06-11 | Lsi Corporation | Error-correction decoder employing extrinsic message averaging |
US8589755B2 (en) * | 2010-06-16 | 2013-11-19 | Nec Laboratories America, Inc. | Reduced-complexity LDPC decoding |
US8443255B2 (en) * | 2010-08-26 | 2013-05-14 | Qualcomm Incorporated | Parity check matrix optimization and selection for iterative decoding |
-
2010
- 2010-10-29 JP JP2010244519A patent/JP5310701B2/ja active Active
-
2011
- 2011-10-28 CN CN201180052487.2A patent/CN103190080B/zh active Active
- 2011-10-28 WO PCT/JP2011/006039 patent/WO2012056713A1/ja active Application Filing
-
2013
- 2013-04-26 US US13/871,901 patent/US9026880B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006059688A1 (ja) * | 2004-12-02 | 2006-06-08 | Mitsubishi Denki Kabushiki Kaisha | 復号装置及び通信装置 |
JP2010245736A (ja) * | 2009-04-03 | 2010-10-28 | Mitsubishi Electric Corp | 復号装置および復号方法 |
Non-Patent Citations (4)
Title |
---|
JPN6013025977; 佐藤 芳行 外3名: 'Group Shuffled BP復号法における効果的なグループ分割法' 電子情報通信学会技術研究報告 Vol.107, No.42, 20070511, pp.13-18 * |
JPN6013025979; Sheng Wu et al.: 'Alternate Iteration of Shuffled Belief Propagation Decoding' Communications and Mobile Computing (CMC), 2010 International Conference on , 20100414, pp.278-281 * |
JPN6013025982; Yeong-Luh Ueng et al.: 'A shuffled message-passing decoding method for memory-based LDPC decoders' Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on , 20090527, pp.892-895 * |
JPN6013025984; Yongmei Dai et al.: 'Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes' Circuits and Systems I: Regular Papers, IEEE Transactions on Vol.55, No.9, 200810, pp.2898-2911 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2012080280A (ja) * | 2010-09-30 | 2012-04-19 | Jvc Kenwood Corp | 復号装置および復号方法 |
Also Published As
Publication number | Publication date |
---|---|
US9026880B2 (en) | 2015-05-05 |
CN103190080B (zh) | 2016-01-20 |
JP5310701B2 (ja) | 2013-10-09 |
WO2012056713A1 (ja) | 2012-05-03 |
CN103190080A (zh) | 2013-07-03 |
US20130238950A1 (en) | 2013-09-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP2012151676A (ja) | 復号装置および復号方法 | |
JP7152394B2 (ja) | Ldpcコードを符号化および復号化するための方法および装置 | |
US10511326B2 (en) | Systems and methods for decoding error correcting codes | |
JP4062435B2 (ja) | 誤り訂正符号復号装置 | |
EP3110009A1 (en) | Encoding method, decoding method, encoding device and decoding device for structured ldpc | |
WO2014122772A1 (ja) | 誤り訂正符号の検査行列のデータ構造、並びに誤り訂正符号の符号化率可変装置および可変方法 | |
JP2008514106A (ja) | Ldpcコードを用いた符号化及び復号化方法 | |
US20190149169A1 (en) | Systems and methods for decoding error correcting codes | |
WO2021063217A1 (zh) | 一种译码方法及装置 | |
JP4832447B2 (ja) | チャネルコードを用いた復号化装置及び方法 | |
US20200153457A1 (en) | Generalized low-density parity check codes (gldpc) | |
KR100943602B1 (ko) | 통신 시스템에서 신호 수신 장치 및 방법 | |
JP5310701B2 (ja) | 復号装置および復号方法 | |
JP5370337B2 (ja) | 復号装置および復号方法 | |
JP5772622B2 (ja) | 復号装置および復号方法 | |
WO2012042786A1 (ja) | 復号装置および復号方法 | |
WO2018084732A1 (en) | Ldpc codes for incremental redundancy harq (ir-harq) schemes | |
JP2013150193A (ja) | 復号装置および復号方法 | |
JP2013070133A (ja) | 復号装置および復号方法 | |
JP2013207396A (ja) | 復号装置、復号方法、プログラム | |
CN118694379A (zh) | 用于ldpc码的解码的提前收敛 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20120724 |
|
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: 20130604 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20130617 |
|
R150 | Certificate of patent or registration of utility model |
Free format text: JAPANESE INTERMEDIATE CODE: R150 Ref document number: 5310701 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R150 |