JP2004032737A - リード−ソロモン復号器 - Google Patents

リード−ソロモン復号器 Download PDF

Info

Publication number
JP2004032737A
JP2004032737A JP2003156793A JP2003156793A JP2004032737A JP 2004032737 A JP2004032737 A JP 2004032737A JP 2003156793 A JP2003156793 A JP 2003156793A JP 2003156793 A JP2003156793 A JP 2003156793A JP 2004032737 A JP2004032737 A JP 2004032737A
Authority
JP
Japan
Prior art keywords
error
reed
calculating
polynomial
solomon
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.)
Pending
Application number
JP2003156793A
Other languages
English (en)
Japanese (ja)
Other versions
JP2004032737A5 (enExample
Inventor
Alexander Kravtchenko
アレクサンダー　クラフチェンコ
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.)
Thomson Licensing SAS
Original Assignee
Thomson Licensing SAS
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 Thomson Licensing SAS filed Critical Thomson Licensing SAS
Publication of JP2004032737A publication Critical patent/JP2004032737A/ja
Publication of JP2004032737A5 publication Critical patent/JP2004032737A5/ja
Pending legal-status Critical Current

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
    • 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1545—Determination of error locations, e.g. Chien search or other methods or arrangements for the determination of the roots of the error locator polynomial
    • 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1515—Reed-Solomon 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1525—Determination and particular use of error location polynomials
    • H03M13/1535—Determination and particular use of error location polynomials using the Euclid algorithm
    • 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/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/154—Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial

Landscapes

  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Correction Of Errors (AREA)
JP2003156793A 2002-06-07 2003-06-02 リード−ソロモン復号器 Pending JP2004032737A (ja)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP02090207A EP1370003A1 (en) 2002-06-07 2002-06-07 Reed-Solomon Decoder

Publications (2)

Publication Number Publication Date
JP2004032737A true JP2004032737A (ja) 2004-01-29
JP2004032737A5 JP2004032737A5 (enExample) 2006-07-13

Family

ID=29433184

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2003156793A Pending JP2004032737A (ja) 2002-06-07 2003-06-02 リード−ソロモン復号器

Country Status (6)

Country Link
US (1) US20030229841A1 (enExample)
EP (1) EP1370003A1 (enExample)
JP (1) JP2004032737A (enExample)
KR (1) KR20030095249A (enExample)
CN (1) CN1467918A (enExample)
TW (1) TWI227599B (enExample)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1502356B1 (en) * 2002-05-08 2006-11-22 Thomson Licensing A method of soft-decision decoding of reed-solomon codes
US20060059409A1 (en) * 2004-09-10 2006-03-16 Hanho Lee Reed-solomon decoder systems for high speed communication and data storage applications
JP4583294B2 (ja) 2005-11-25 2010-11-17 東芝ストレージデバイス株式会社 誤り訂正装置、誤り訂正プログラム、及び誤り訂正方法
KR101149110B1 (ko) * 2006-02-22 2012-05-25 삼성전자주식회사 디지털 통신 시스템의 ｒｓ 복호기
US7689894B2 (en) * 2006-05-11 2010-03-30 Mediatek Inc. Decoding apparatus and method therefor
CN101001089B (zh) * 2006-12-28 2010-06-16 安凯(广州)微电子技术有限公司 一种纠错码解码中的钱搜索方法及装置
CN101345533B (zh) * 2007-07-11 2011-06-01 光宝科技股份有限公司 里得-索罗门解码中有效率的陈氏寻根方法及系统
US8418041B2 (en) 2008-12-03 2013-04-09 Electronics And Telecommunications Research Institute MPE-FEC RS decoder and decoding method thereof
KR101317179B1 (ko) * 2008-12-03 2013-10-15 한국전자통신연구원 Ｍｐｅ-ｆｅｃ ｒｓ 디코더 및 이의 복호 방법
CN101459431B (zh) * 2008-12-30 2012-03-07 北京大学 一种信道纠错码bch码和rs码的译码方法
CN101854180B (zh) * 2010-06-01 2013-04-24 福建新大陆电脑股份有限公司 一种条码纠错译码装置
US9032277B1 (en) * 2011-11-28 2015-05-12 Altera Corporation Parallel low and asymmetric rate Reed Solomon coding
JP2014082574A (ja) 2012-10-15 2014-05-08 Samsung Electronics Co Ltd 誤り検出訂正回路、及びメモリ装置
US8977938B2 (en) * 2013-02-08 2015-03-10 Altera Corporation Parallel decomposition of Reed Solomon umbrella codes
US10686471B2 (en) * 2017-11-22 2020-06-16 Samsung Electronics Co., Ltd. One-sub-symbol linear repair schemes
WO2022226962A1 (zh) * 2021-04-30 2022-11-03 华为技术有限公司 Rs码的译码的方法和通信装置
US11750222B1 (en) * 2022-06-29 2023-09-05 Synopsys, Inc. Throughput efficient Reed-Solomon forward error correction decoding
CN116192661B (zh) * 2023-04-26 2023-09-29 苏州联讯仪器股份有限公司 通信模块的稳定性评估方法、装置、设备及可读存储介质

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5170399A (en) * 1989-08-30 1992-12-08 Idaho Research Foundation, Inc. Reed-Solomon Euclid algorithm decoder having a process configurable Euclid stack
US5537426A (en) * 1992-05-29 1996-07-16 Goldstar Co., Ltd. Operation apparatus for deriving erasure position Γ(x) and Forney syndrome T(x) polynomials of a Galois field employing a single multiplier
US5379305A (en) * 1992-07-20 1995-01-03 Digital Equipment Corporation Error correction system with selectable error correction capabilities
US5715262A (en) * 1995-07-12 1998-02-03 Lsi Logic Corporation Errors and erasures correcting reed-solomon decoder
US6279137B1 (en) * 1998-12-08 2001-08-21 Lsi Logic Corporation System and method for a storage-efficient parallel Chien Search
US6347389B1 (en) * 1999-03-23 2002-02-12 Storage Technology Corporation Pipelined high speed reed-solomon error/erasure decoder
EP1102406A3 (en) * 1999-11-17 2003-11-19 STMicroelectronics, Inc. Apparatus and method for decoding digital data
US6539515B1 (en) * 1999-11-24 2003-03-25 Koninklijke Philips Electronics N.V. Accelerated Reed-Solomon error correction

Also Published As

Publication number Publication date
TW200308149A (en) 2003-12-16
TWI227599B (en) 2005-02-01
EP1370003A1 (en) 2003-12-10
CN1467918A (zh) 2004-01-14
KR20030095249A (ko) 2003-12-18
US20030229841A1 (en) 2003-12-11

Similar Documents

Publication Publication Date Title
US6374383B1 (en) Determining error locations using error correction codes
CN1227817C (zh) 加速Reed Solomon解码器,解码接收码字的方法和同时估算多个变元的多项式的方法
EP1131893B1 (en) Forward error corrector
US5715262A (en) Errors and erasures correcting reed-solomon decoder
US7404134B2 (en) Encoding/decoding device using a reed-solomon encoder/decoder
JP5300170B2 (ja) 順方向のチェンサーチ方式のリードソロモンデコーダ回路
JP2004032737A (ja) リード−ソロモン復号器
WO2000057561A1 (en) Pipelined high speed reed-solomon error/erasure decoder
US5535225A (en) Time domain algebraic encoder/decoder
JP3830527B2 (ja) ３つおよび４つのエラーを訂正するための改良されたシステム
US7502989B2 (en) Even-load software Reed-Solomon decoder
US7051267B1 (en) Efficient high-speed Reed-Solomon decoder
CN101483442A (zh) 根据Nand Flash多余空间来配置纠错能力的BCH解码器
EP1102406A2 (en) Apparatus and method for decoding digital data
US20100174970A1 (en) Efficient implementation of a key-equation solver for bch codes
US6915478B2 (en) Method and apparatus for computing Reed-Solomon error magnitudes
JP2000020333A (ja) 復号装置、演算装置およびこれらの方法
KR101226439B1 (ko) 리드-솔로몬 디코더, 이를 포함하는 메모리 시스템 및 디코딩 방법
US8255777B2 (en) Systems and methods for locating error bits in encoded data
US6691277B1 (en) High speed pre-computing circuit and method for finding the error-locator polynomial roots in a Reed-Solomon decoder
US7117425B2 (en) Decoder architecture for reed solomon codes
US20250173123A1 (en) Polynomial root search circuitry
EP1370005A2 (en) Reed-Solomon decoder
JPH1065552A (ja) 誤り訂正の演算処理方法及び処理回路
Abirsha et al. An Efficient Carry Skip Adder Based Reduced Complexity RS-Decoder

Legal Events

Date Code Title Description
RD04 Notification of resignation of power of attorney

Free format text: JAPANESE INTERMEDIATE CODE: A7424

Effective date: 20040415

A521 Request for written amendment filed

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20060524

A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20060524

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20070220

A601 Written request for extension of time

Free format text: JAPANESE INTERMEDIATE CODE: A601

Effective date: 20070518

A602 Written permission of extension of time

Free format text: JAPANESE INTERMEDIATE CODE: A602

Effective date: 20070523

A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 20071016