[go: up one dir, main page]

AU2002320749A1 - Iterative decoding method and apparatus for product code based on adjoint formula - Google Patents

Iterative decoding method and apparatus for product code based on adjoint formula

Info

Publication number
AU2002320749A1
AU2002320749A1 AU2002320749A AU2002320749A AU2002320749A1 AU 2002320749 A1 AU2002320749 A1 AU 2002320749A1 AU 2002320749 A AU2002320749 A AU 2002320749A AU 2002320749 A AU2002320749 A AU 2002320749A AU 2002320749 A1 AU2002320749 A1 AU 2002320749A1
Authority
AU
Australia
Prior art keywords
decoding method
product code
code based
iterative decoding
adjoint
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.)
Abandoned
Application number
AU2002320749A
Inventor
Zongwang Li
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Linkair Communications Inc
Original Assignee
Linkair Communications Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Linkair Communications Inc filed Critical Linkair Communications Inc
Publication of AU2002320749A1 publication Critical patent/AU2002320749A1/en
Abandoned legal-status Critical Current

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/1105—Decoding
    • H03M13/1131—Scheduling of bit node or check node processing
    • H03M13/1134—Full parallel processing, i.e. all bit nodes or check nodes are 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/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
    • 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
    • H03M13/2909—Product 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/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/2948—Iterative decoding

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Correction Of Errors (AREA)
AU2002320749A 2002-07-01 2002-07-01 Iterative decoding method and apparatus for product code based on adjoint formula Abandoned AU2002320749A1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2002/000457 WO2004004132A1 (en) 2002-07-01 2002-07-01 Iterative decoding method and apparatus for product code based on adjoint formula

Publications (1)

Publication Number Publication Date
AU2002320749A1 true AU2002320749A1 (en) 2004-01-19

Family

ID=29783999

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2002320749A Abandoned AU2002320749A1 (en) 2002-07-01 2002-07-01 Iterative decoding method and apparatus for product code based on adjoint formula

Country Status (3)

Country Link
CN (1) CN1555603A (en)
AU (1) AU2002320749A1 (en)
WO (1) WO2004004132A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9391641B2 (en) * 2013-04-26 2016-07-12 SK Hynix Inc. Syndrome tables for decoding turbo-product codes
CN104022786B (en) * 2014-05-21 2017-09-01 上海宏光经济信息发展中心青岛电子技术部 Product code coding method
CN114050898B (en) * 2021-11-08 2024-07-09 南京理工大学 QKD negotiation method based on HLS and LDPC code construction
CN117976021B (en) * 2024-04-01 2024-06-11 陕西中安数联信息技术有限公司 Data storage method and system for multiple data blocks combined with LDPC coding

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2712760B1 (en) * 1993-11-19 1996-01-26 France Telecom Method for transmitting bits of information by applying concatenated block codes.
FR2756996A1 (en) * 1996-12-10 1998-06-12 Philips Electronics Nv DIGITAL TRANSMISSION SYSTEM AND METHOD COMPRISING A PRODUCT CODE COMBINED WITH MULTI-DIMENSIONAL MODULATION
FR2778289B1 (en) * 1998-05-04 2000-06-09 Alsthom Cge Alcatel ITERATIVE DECODING OF PRODUCT CODES
JP2002526965A (en) * 1998-09-28 2002-08-20 アドバンスト ハードウェア アーキテクチャーズ，インコーポレイテッド Turbo product code decoder

Also Published As

Publication number Publication date
WO2004004132A1 (en) 2004-01-08
CN1555603A (en) 2004-12-15

Similar Documents

Publication Publication Date Title
AU2002364182A1 (en) Methods and apparatus for encoding ldpc codes
AU2003267242A1 (en) Method and apparatus for encoding data
AU2003218424A1 (en) Symbol encoding apparatus and method
AU2002234256A1 (en) Apparatus and method for decoding damaged optical codes
AU2003219926A1 (en) Method and apparatus for recognizing objects
AU2003203270A1 (en) Moving picture coding method and apparatus and decoding method and apparatus
AU2003237197A1 (en) Method and apparatus for transporting data
AU2003293661A1 (en) Method and apparatus for coding/decoding items of subtitling data
AU2003272371A1 (en) Sparse media edi apparatus and method
ZA200504039B (en) Billhandling apparatus and method for transmitting code information
AU2003228459A1 (en) A decoding method and apparatus
AU2003230729A1 (en) Method and apparatus for blind code detection
AU2002349504A1 (en) Code reading apparatus
AU2003215855A1 (en) Method and apparatus for multi-dimensionally encoding and decoding
AU2003299010A1 (en) Method and apparatus for arithmetic coding and decoding
AU2003249666A1 (en) Methods and apparatus for tuning using successive aproximation
EP1573469A3 (en) Apparatus and method for multiple description encoding
EP1388948A3 (en) Turbo decoding apparatus and method
AU2003272810A1 (en) Method and apparatus to detect and decode information
AU2003253760A1 (en) Method and apparatus for space-time turbo-coded modulation
AU2003248942A1 (en) Scale reading apparatus
AU2003228367A1 (en) Method and apparatus for counterconcurrent chromatography
AU2002347417A1 (en) Space-dyeing method and apparatus
AU2002320749A1 (en) Iterative decoding method and apparatus for product code based on adjoint formula
AU2003304150A1 (en) Method and apparatus for recognizing molecular compounds

Legal Events

Date Code Title Description
MK6 Application lapsed section 142(2)(f)/reg. 8.3(3) - pct applic. not entering national phase