WO2015068765A1 - Dispositif de décodage - Google Patents

Dispositif de décodage Download PDF

Info

Publication number
WO2015068765A1
WO2015068765A1 PCT/JP2014/079455 JP2014079455W WO2015068765A1 WO 2015068765 A1 WO2015068765 A1 WO 2015068765A1 JP 2014079455 W JP2014079455 W JP 2014079455W WO 2015068765 A1 WO2015068765 A1 WO 2015068765A1
Authority
WO
WIPO (PCT)
Prior art keywords
decoding
packet
calculation
packets
matrix
Prior art date
Application number
PCT/JP2014/079455
Other languages
English (en)
Japanese (ja)
Inventor
松本　渉
Original Assignee
三菱電機株式会社
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 三菱電機株式会社 filed Critical 三菱電機株式会社
Publication of WO2015068765A1 publication Critical patent/WO2015068765A1/fr

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/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/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
    • 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/373—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes

Definitions

  • the present invention is based on the premise that an encoded packet is transmitted from an encoding device included in a transmitter that encodes an error correction code for correcting a transmission error that occurs on a transmission path.
  • the present invention relates to a decoding device for decoding received packets.
  • the erasure correction code is used for encoding in units of packets on the transmitter side, and the receiver side receives a packet sequence partially lost by the communication path, Based on the successfully received packet, the lost packet is decoded by Gaussian elimination or the like.
  • a lost packet is a packet that has failed to be received, and a packet that has failed to be received is expressed as lost because information on all the bits constituting the packet cannot be obtained.
  • Non-Patent Document 1 there has been one as shown in Non-Patent Document 1, for example.
  • a group of information bits is expressed as a packet, but it may be expressed as a block, and has the same effect.
  • the description will be limited to the expression packet.
  • the decoding method generally requires a calculation amount corresponding to the number of “1” s in the parity check matrix, and requires a memory amount and a calculation amount depending on the size of the number of rows ⁇ the number of columns.
  • the present invention has been made to solve the above-described problems, and an object thereof is to obtain a decoding device that can reduce the amount of calculation in decoding calculation.
  • the decoding device is a decoding device that performs decoding of an error correction code for correcting a transmission error that occurs on a transmission line, and includes an erasure correction decoding unit that performs decoding calculation using a generation matrix instead of a check matrix It is provided.
  • the decoding apparatus performs the decoding calculation using the generator matrix when decoding the error correction code, the calculation amount of the decoding calculation can be reduced.
  • the decoding apparatus since it is possible to operate even with a CPU having a low processing capability, there is an effect that an erasure correction coding / decoding function can be mounted in a lower-cost communication system.
  • a CPU with processing capability there is an effect that higher-speed processing can be realized.
  • FIG. 1 is a block diagram showing a communication system to which a decoding device according to Embodiment 1 of the present invention is applied.
  • the illustrated communication system includes a transmitter 10 and a receiver 20.
  • the transmitter 10 is an encoding device, and includes a packet generation unit 11, an erasure correction encoding unit 12, and a transmission unit 13.
  • the receiver 20 is a decoding device, and includes a receiving unit 21, an erasure correction decoding unit 22, and an information bit reproduction unit 23.
  • the packet generator 11 is a processor that generates a packet from information bits using a check matrix.
  • the erasure correction encoding unit 12 is a processing unit that performs erasure error correction encoding on a packet.
  • the transmission unit 13 is a processing unit for transmitting the encoded packet to the receiver 20 via the communication path 30.
  • the receiver 21 receives a packet transmitted from the transmitter 10 via the communication path 30.
  • the erasure correction decoding unit 22 is a processing unit that performs error detection and erasure correction on these packets.
  • the information bit reproduction unit 23 is a processing unit that combines the decoded packets to generate information bits.
  • each packet is composed of 1-bit information.
  • the processing shown below includes a plurality of bits in each packet, and the same processing is executed in parallel.
  • An encoded packet vector v (u
  • a parity packet vector consisting of
  • an encoded packet vector v (u
  • an expression describing a vector of an encoded packet on a generator matrix is used as appropriate.
  • the blank part means element 0, and hereinafter the same expression is used. It is assumed that the calculation is performed on GF (2) expressed by 0 and 1 hereinafter.
  • the decoding side uses the check matrix H to perform decoding by the Gaussian elimination method or the like.
  • an expression describing a vector of a code packet on a check matrix is used as appropriate.
  • the reception success packet and the reception failure packet are first exchanged.
  • decoding calculation is performed using a generator matrix, (i) a method of decoding using only successfully received packets, and (ii) information packets are lost
  • a method of decoding using only successful reception packets related to packets and (iii) a method in which the number of successfully received packets is the upper limit of the number of information packets ⁇ ⁇ and is not subject to decoding calculation.
  • the successful reception packet is 9 out of 15 encoded packets u 1 , u 3 , u 4 , u 6 , u 7 , p 2 , p 4 , p 5 , p 7, and lost packets.
  • the successful reception packet is 9 out of 15 encoded packets u 1 , u 3 , u 4 , u 6 , u 7 , p 2 , p 4 , p 5 , p 7, and lost packets.
  • u 2 , u 5 , p 1 , p 3 , p 4 , p 8 are lost packets.
  • the generator matrix G is shown as the equation (4) as a packet in which the square frame ⁇ mark is lost.
  • the columns corresponding to the successful reception packet and the lost packet are exchanged.
  • the column having the 1 in the i-th row and the i-th column are switched. Thereafter, the replaced i-th column is fixed, and the replaced i-column is added in units of columns to the column where 1 exists in the i-th row in the other columns. At the same time, the value of the received packet corresponding to the column is added and stored as a new value corresponding to the column. For example:
  • the lost packet can be decoded with a small amount of calculation.
  • the packet error rate PER Packet Error Rate
  • PER Packet Error Rate
  • a generator matrix is used instead of a check matrix. Since the erasure correction decoding unit for decoding is provided, the amount of decoding calculation can be reduced.
  • the erasure correction decoding unit performs the decoding calculation using only the packet that has been successfully received and the partial matrix of the check matrix corresponding to this packet. The amount of calculation can be reduced.
  • the erasure correction decoding unit rearranges the columns or rows of the generation matrix corresponding to the successfully received packet, and configures the partial matrix corresponding to the successfully received packet, Since the matrix corresponding to the lost packet is deleted and the decoding calculation is performed, the calculation amount of the decoding calculation can be reduced.
  • Embodiment 2 a method of decoding using only reception success packets related to lost packets among information packets will be described as a second embodiment.
  • the generation matrix G is used to associate the reception success packet and the lost packet as shown in Expression (4).
  • the difference from the decoding method 1 of the present invention is that the columns corresponding to successful reception packets and lost packets are not exchanged thereafter.
  • all the elements of the column corresponding to the lost packet are set to 0 from the equation (4), and the following matrix G ′ is generated.
  • a Gaussian elimination method in the row direction is performed on this G ′ in units of columns.
  • the calculation is performed diagonally from the left end, and when the successful reception packet is the i-th packet in the encoded packet, since there is definitely 1 in the i-th row, the i-th row in the i-th column Without checking whether or not there is 1 in the eye, the i-th column is fixed, and the i-th column is added in units of columns to the other column in which 1 exists in the i-th row. At the same time, the value of the received packet corresponding to the column is added and stored as a new value corresponding to the column.
  • the lost packet is the i-th packet in the encoded packet, there is no 1 in the i-th row and no i-th row, so it is not checked whether there is a 1 in the i-th row.
  • the column with 1 in the i-th row is exchanged with the i-th column. Thereafter, the replaced i-th column is fixed, and the replaced i-column is added in units of columns to the column where 1 exists in the i-th row in the other columns. At the same time, the value of the received packet corresponding to the column is added and stored as a new value corresponding to the column.
  • the erasure correction decoding unit uses an irreducible standard generation matrix whose information packet part is composed of a diagonal matrix, and supports packets that have been successfully received.
  • the lost packet is not calculated without calculating the packet that has been successfully received. Since only the calculation for decoding is performed, the calculation amount of the decoding calculation can be further reduced.
  • Embodiment 3 a third embodiment will be described as a method in which the number of successfully received packets is the upper limit of the number of information packets.times..alpha.
  • the number of information packets 5, the number of parity packets 10, and the number of encoded packets 15 are transmitted from the transmitter, and the reception success packets are u 1 , u 2 , u 4 , u 5 , p 1 , p 2 , p.
  • 13 packets of 3 , p 5 , p 6 , p 7 , p 8 , p 9 and p 10 and 2 lost packets are u 3 and p 4 packets.
  • a generator matrix G is shown as a formula (5) as a packet in which the square frame ⁇ mark is lost.
  • the packet error rate when it is desired to set the packet error rate to 10 ⁇ 8 or less, the value shown in FIG. 2 is taken. This number may be appropriately changed according to the number of information packets, the target performance, and the code performance, and an arbitrary value can be set.
  • the erasure correction decoding unit sets an upper limit for the number of successful reception packets necessary for decoding to be equal to or greater than the number of information packets, and receives successful reception packets exceeding the upper limit. Since it is excluded from the decryption calculation target, the calculation amount of the decryption calculation can be further reduced.
  • the processing unit has been expressed as a packet in the expression so far, but it can be applied to any data processed in a lump of bits regardless of the name of the packet, and it may be called a block. is there.
  • the encoding / decoding method described above can be applied to an error correction code such as a physical layer corresponding to a check matrix in bit units in addition to an erasure correction code in which error correction is performed in packet units or block units.
  • an error correction code such as a physical layer corresponding to a check matrix in bit units in addition to an erasure correction code in which error correction is performed in packet units or block units.
  • the present invention can be freely combined with each embodiment, any component of each embodiment can be modified, or any component can be omitted in each embodiment. .
  • the decoding apparatus includes the erasure correction decoding unit that performs decoding calculation using a generation matrix instead of a check matrix, the amount of decoding calculation can be reduced, and the decoding apparatus is used for a low-cost communication system. Suitable for

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Algebra (AREA)
  • Computing Systems (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

　Un dispositif de décodage effectue le décodage d'un signal de correction d'erreur en vue de corriger des erreurs de transmission survenues sur une voie de transmission, le dispositif de décodage comprenant une unité de décodage de correction avec perte (22) destinée à effectuer des calculs de décodage à l'aide d'une matrice génératrice à la place d'une matrice de vérification. L'unité de décodage de correction avec perte (22) remet en ordre la colonne ou la rangée de la matrice génératrice correspondant à un paquet reçu avec succès et forme une sous-matrice correspondant au paquet reçu avec succès, le calcul de décodage étant effectué après retrait des matrices correspondant aux paquets perdus.
PCT/JP2014/079455 2013-11-07 2014-11-06 Dispositif de décodage WO2015068765A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2013-231076 2013-11-07
JP2013231076A JP2017005285A (ja) 2013-11-07 2013-11-07 復号装置

Publications (1)

Publication Number Publication Date
WO2015068765A1 true WO2015068765A1 (fr) 2015-05-14

Family

ID=53041541

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2014/079455 WO2015068765A1 (fr) 2013-11-07 2014-11-06 Dispositif de décodage

Country Status (2)

Country Link
JP (1) JP2017005285A (fr)
WO (1) WO2015068765A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005107081A1 (fr) * 2004-04-28 2005-11-10 Mitsubishi Denki Kabushiki Kaisha Procédé de contrôle de retransmission et dispositif de communication
WO2007072721A1 (fr) * 2005-12-20 2007-06-28 Mitsubishi Electric Corporation Procede de generation de matrice d’inspection, procede de codage, dispositif de communication, systeme de communication et codeur
US20110060960A1 (en) * 2008-05-14 2011-03-10 Zte Corporation Decoding method and device for low density generator matrix codes
JP5216099B2 (ja) * 2007-12-07 2013-06-19 ゼットティーイー コーポレイション 低密度生成マトリックスコードのエンコード方法及び装置、ならびにデコード方法及び装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005107081A1 (fr) * 2004-04-28 2005-11-10 Mitsubishi Denki Kabushiki Kaisha Procédé de contrôle de retransmission et dispositif de communication
WO2007072721A1 (fr) * 2005-12-20 2007-06-28 Mitsubishi Electric Corporation Procede de generation de matrice d’inspection, procede de codage, dispositif de communication, systeme de communication et codeur
JP5216099B2 (ja) * 2007-12-07 2013-06-19 ゼットティーイー コーポレイション 低密度生成マトリックスコードのエンコード方法及び装置、ならびにデコード方法及び装置
US20110060960A1 (en) * 2008-05-14 2011-03-10 Zte Corporation Decoding method and device for low density generator matrix codes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KUNITAKA MUROTSU ET AL., THE 27TH SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (SITA2004) YOKOSHU, 17 December 2004 (2004-12-17), pages 271 - 274 *

Also Published As

Publication number Publication date
JP2017005285A (ja) 2017-01-05

Similar Documents

Publication Publication Date Title
US10680651B2 (en) Signature-enabled polar encoder and decoder
JP5863200B2 (ja) フレキシブルなソースブロックのマッピングを伴う伸縮性符号を使用した符号化および復号
EP1603268B1 (fr) Procédé de distribution de clé quantique et dispositif de transmission
CN105453466B (zh) 极化码的速率匹配方法及装置
JP5875713B2 (ja) 送信機および受信機、並びに符号化率可変方法
WO2004028074A1 (fr) Procede de distribution de cle quantique et dispositif de communication
US8683301B2 (en) Error correction coding for recovering multiple packets in a group in view of limited bandwidth
US20140289590A1 (en) Systems, methods, apparatus and computer program products for highly reliable file delivery using compound and braided fec encoding and decoding
US8612842B2 (en) Apparatus for generating a checksum
EP3416332B1 (fr) Dispositif, système et procédé de communication quantique
US9131393B2 (en) Method for optimizing the resources of a data transmission at the level of the MAC layer and device implementing the method
US9059735B2 (en) Decoding method and decoding device
JP6504162B2 (ja) 端末、パケット復号方法、および、プログラムが記憶された記憶媒体
WO2015068765A1 (fr) Dispositif de décodage
US20130198582A1 (en) Supercharged codes
JP2017175495A (ja) 送信装置、受信装置、通信システム、方法およびプログラム
JP5595260B2 (ja) 受信機
CN108737075B (zh) 一种生成共享密钥的方法、装置及系统
JP2010033181A (ja) エラー訂正回路、および半導体メモリシステム
CN107666367B (zh) 一种编码方法及装置
JP2015032885A (ja) 符号化装置及び復号装置
US20220345338A1 (en) Apparatus and method for transmitting a bit in addition to a plurality of payload data symbols of a communication protocol, and apparatus and method for decoding a data signal
JP2010136279A (ja) 符号化装置、復号装置、生成行列の作成方法及びコンピュータプログラム
JP2004312684A (ja) Ｗａｎでの大容量パケット伝送装置、ｗａｎでの大容量パケット送信方法及び受信方法、並びにｗａｎでの大容量パケット送受信方法
RU2575399C1 (ru) Способ декодирования ldpc-кодов и устройство его реализующее

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14860024

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: JP

122 Ep: pct application non-entry in european phase

Ref document number: 14860024

Country of ref document: EP

Kind code of ref document: A1