JPH0258815B2 - - Google Patents

Info

Publication number
JPH0258815B2
JPH0258815B2 JP58112664A JP11266483A JPH0258815B2 JP H0258815 B2 JPH0258815 B2 JP H0258815B2 JP 58112664 A JP58112664 A JP 58112664A JP 11266483 A JP11266483 A JP 11266483A JP H0258815 B2 JPH0258815 B2 JP H0258815B2
Authority
JP
Japan
Prior art keywords
code
error correction
error
parity
code word
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.)
Expired - Lifetime
Application number
JP58112664A
Other languages
Japanese (ja)
Other versions
JPS59131237A (en
Inventor
Yasuhiro Hirano
Seiichi Mita
Yoshizumi Eto
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.)
Hitachi Denshi KK
Original Assignee
Hitachi Denshi KK
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 Hitachi Denshi KK filed Critical Hitachi Denshi KK
Priority to JP11266483A priority Critical patent/JPS59131237A/en
Publication of JPS59131237A publication Critical patent/JPS59131237A/en
Publication of JPH0258815B2 publication Critical patent/JPH0258815B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's

Description

【発明の詳細な説明】 デイジタルVTR等の高密度磁気記録装置では
再生時に符号誤りが発生しやすく、このため、誤
り訂正符号による訂正が行なわれる。しかも符号
誤りが多い場合には、誤り訂正自体が誤つて行な
われる可能性がある。例えば、誤に訂正符号とし
て単一誤り訂正ハミング符号を用いた場合、1符
号語内の符号誤りが1個のときは訂正できるが、
2個以上の符号誤りがある場合には誤訂正を行な
う可能性がある。しかも、誤り訂正を行なつた後
では、誤訂正があつたかどうかの判定は不可能で
あるという問題がある。これを解決するには、誤
り訂正符号の訂正能力を高めることが考えられる
が、このようにするには、誤り訂正符号における
検査点すなわち検査ビツト数を増加する必要があ
り、この結果、伝送効率が低下する欠点がある。
DETAILED DESCRIPTION OF THE INVENTION In a high-density magnetic recording device such as a digital VTR, code errors are likely to occur during reproduction, and therefore correction is performed using an error correction code. Furthermore, if there are many code errors, there is a possibility that the error correction itself will be performed incorrectly. For example, if a single error-correcting Hamming code is used as an error-correcting code, it is possible to correct one code error in one code word, but
If there are two or more code errors, there is a possibility that erroneous correction will be performed. Moreover, there is a problem in that after error correction is performed, it is impossible to determine whether or not an error correction has been made. To solve this problem, it is possible to improve the correction ability of the error correction code, but to do this, it is necessary to increase the number of check points in the error correction code, that is, the number of check bits, and as a result, the transmission efficiency It has the disadvantage that it decreases.

本発明の目的は、符号器において誤り訂正符号
の各符号語間にパリテイを付加し、復号器におい
て誤り訂正後の符号語間のパリテイと受信された
パリテイとを比較し誤訂正を除去することによ
り、上記欠点をなくすことにある。
An object of the present invention is to add parity between each code word of an error correction code in an encoder, and to remove error correction by comparing the parity between code words after error correction with the received parity in a decoder. The purpose is to eliminate the above drawbacks.

次に、本発明の原理について説明する。 Next, the principle of the present invention will be explained.

送信側では第1図に示すように、符号長n+1
の誤り訂正符号Wiをm(同図の場合、m=3)個
用いて1つの符号ブロツクを構成する。なお各符
号ブロツクは、m個の誤り訂正符号W1〜Wn、お
よび各符号間のパリテイPk 但し、 Pkni=1 Wik(mod2),k=0,1,…,n (同図の場合、Pi3j=1 Wji(mod2)) で構成する。
On the transmitting side, as shown in Figure 1, the code length is n+1.
One code block is constructed by using m (in the case of the figure, m=3) error correction codes W i . Each code block has m error correction codes W 1 to W n and parity P k between each code, where P k = ni=1 W ik (mod2), k = 0, 1,..., n (in the case of the same figure, P i = 3j=1 W ji (mod2)).

すなわち同図では P0=W10+W20+W30(mod2) となる。このように構成された符号を、例えば
VTRへの記録等に用いる。
That is, in the figure, P 0 =W 10 +W 20 +W 30 (mod2). For example, the code constructed in this way is
Used for recording to VTR, etc.

第2図に誤り訂正後の受信符号およびその後の
誤訂正の処理の過程を示す。
FIG. 2 shows the received code after error correction and the subsequent error correction process.

受信側ではまず誤り訂正処理を行ない、かつ符
号誤りのあつた符号語Wj′(同図aではj=3)
を記憶しておく。次いで、誤り訂正後の符号
W1′〜Wn′(同図aではm=3)に対し、第2図
aに示すように、各符号間のパリテイPk′ Pk′=ni=1 Wik′(mod2),k=0,1,2,…,
n すなわち同図の場合は、 P0′=W10′+W20′+W30′(mod2) を求める。次いで、Pk′と受信パリテイPkとを比
較する。
On the receiving side, error correction processing is first performed, and the code word W j ' with a code error (j = 3 in a of the same figure)
Remember. Then, the code after error correction
For W 1 ′ to W n ′ (m=3 in figure a), the parity between each code P k ′ P k ′= ni=1 W ik ′ (mod2 ), k=0, 1, 2,...,
In other words, in the case of the same figure, find P 0 ′=W 10 ′+W 20 ′+W 30 ′ (mod2). Next, P k ′ and received parity P k are compared.

ここで、受信パリテイPkに誤りがなく、かつ
誤り訂正において誤訂正がなければ、PkとPk′と
は一致する。
Here, if there is no error in the received parity P k and if there is no erroneous correction in error correction, P k and P k ′ match.

一方、誤り訂正において誤訂正があれば、第2
図bのようにPkとPk′とは、矢印で対比して示し
た位置のパリテイが一致しない。この場合、先に
記憶しておいた符号誤りの符号語Wjが1個しか
存在しなければ、その符号語の受信パリテイPk
と誤り訂正後のパリテイPk′とが不一致となる位
置の符号すなわち同図aに矢印で示するうに、符
号語W3′のハツチングを施した部分の符号をそれ
ぞれ反転すれば、この符号語の誤り(符号誤りと
誤訂正による誤りとの両方)は訂正される。
On the other hand, if there is an error in error correction, the second
As shown in FIG. b, P k and P k ′ do not match in parity at the positions indicated by arrows. In this case, if there is only one previously stored code word W j with a code error, the reception parity P k of that code word is
If the code at the position where the code and the parity P k ′ after error correction do not match, that is, the code of the hatched part of the code word W 3 ′ as shown by the arrow in a in the same figure, is inverted, this code word errors (both code errors and errors due to miscorrection) are corrected.

なお、先に記憶しておいた符号誤りのある符号
語Wjが複数個存在する場合には、どこに誤訂正
があつたかは判定不可能なため、符号誤りのあつ
た符号語をすでに復号済の修正符号(テレビジヨ
ン信号の場合は、たとえば1ライン前の符号)で
置換する。このようにして、誤り訂正において誤
訂正のあつた場合、その影響を除去することがで
きる。
Note that if there are multiple previously stored code words W j with code errors, it is impossible to determine where the error correction occurred, so the code word with the code error has already been decoded. (in the case of a television signal, for example, the code of one line before). In this way, if an erroneous correction occurs during error correction, its influence can be removed.

次に本発明の実施例について説明する。第3図
は送信側の構成例を示し、誤り訂正用の符号器1
において入力符号から訂正用の符号語Wiをつく
り、パリテイ付加回路2において各符号語Wi
対してパリテイPkを求める。そして、スイツチ
3により符号語とパリテイとを選択して1つの符
号ブロツクを構成し送信符号として送出し、例え
ばVTRに記録する。
Next, examples of the present invention will be described. Figure 3 shows an example of the configuration of the transmitting side, with an encoder 1 for error correction.
A correction code word W i is created from the input code, and a parity P k is determined for each code word W i in the parity adding circuit 2. Then, the switch 3 selects the code word and parity to form one code block, which is sent out as a transmission code and recorded on, for example, a VTR.

受信側は第4図のように構成され、VTR等か
らの受信符号は誤り訂正復号器4において、符号
誤りの検出および訂正が行なわれる。もし、符号
誤りのある符号語Wiが存在すれば、誤り符号語
表示回路5に記憶される。一方、誤り訂正復号器
4の出力として得られた誤り訂正後の符号はパリ
テイ検査回路6に加えられ、ここでパリテイ
Pk′を求め、受信符号から求めた受信パリテイPk
と比較する。誤り符号語表示回路5に誤りのある
符号語が存在し、かつパリテイ検査回路6におい
てパリテイPk′とPkとが不一致の場合には、誤り
修正回路7において誤り修正が行なわれる。この
場合、誤り符号語が1個のみのときには、その誤
り符号語においてパリテイが不一致の位置の符号
を反転し訂正を行なう。一方、複数個の符号語が
誤まつている場合には、誤り符号語を前述の修正
符号で置換する。
The receiving side is constructed as shown in FIG. 4, and the error correction decoder 4 detects and corrects code errors in received codes from a VTR or the like. If a code word W i with a code error exists, it is stored in the error code word display circuit 5. On the other hand, the error-corrected code obtained as the output of the error correction decoder 4 is applied to the parity check circuit 6, where the parity check circuit 6
Determine P k ′ and receive parity P k determined from the received code.
Compare with. If there is an erroneous code word in the error code word display circuit 5 and the parities P k ' and P k do not match in the parity check circuit 6, the error correction circuit 7 corrects the error. In this case, when there is only one error code word, correction is performed by inverting the code at the position where the parity does not match in the error code word. On the other hand, if a plurality of code words are mistaken, the error code word is replaced with the above-mentioned correction code.

なお、付加すべきパリテイ符号は、誤り訂正符
号の情報点すなわち情報ビツトに限定してもよ
い。この理由は受信符号において、実際の誤訂正
の影響は、情報点に誤訂正がある場合に限定され
るからである。更に、テレビジヨン信号等では8
ビツトのPCM符号のうち、下位4ビツト程度は
符号誤りがあつても画質がそれほど劣化しないと
いう性質があり、この性質を利用して、情報点の
うち、例えば上位4ビツトに対してのみパリテイ
符号を付加するような手段を用いることにより、
付加するビツト数を軽減することができる。ま
た、ここに使用する誤り訂正符号としては、どの
ような誤り訂正符号でも適用可能である。
Note that the parity code to be added may be limited to the information points of the error correction code, that is, the information bits. The reason for this is that in the received code, the effect of actual error correction is limited to the case where there is an error correction at an information point. Furthermore, television signals, etc.
Among bit PCM codes, there is a property that the image quality does not deteriorate much even if there is a code error in the lower 4 bits.Using this property, parity codes are applied only to the upper 4 bits of the information points. By using means that add
The number of bits to be added can be reduced. Moreover, any error correction code can be used as the error correction code used here.

なお本発明では、1つの符号ブロツクに符号誤
りのある符号語が1個しか存在しない場合に、誤
訂正除去の効果が大きい。したがつて想定される
符号誤りを考慮して、符号ブロツクにおける符号
語の含まれる数mを、誤りが1個の符号語になる
ように設定すれば、得られる効果は大きい。
In the present invention, the effect of error correction removal is large when there is only one code word with a code error in one code block. Therefore, if the number m of code words included in a code block is set in consideration of possible code errors so that the error is one code word, a large effect can be obtained.

以上述べたように、本発明によるときは少量の
パリテイ符号を付加することにより、誤り訂正復
号の際に発生する誤訂正を除去することが可能と
なり、その効果は大きいものである。
As described above, according to the present invention, by adding a small amount of parity code, it is possible to remove error corrections that occur during error correction decoding, and the effect is significant.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明による送信符号の構成を示す説
明図、第2図aは同じく受信符号の構成を示す説
明図、同図bは受信したパリテイ符号と誤り訂正
後のパリテイ符号との不一致部分を示す説明図、
第3図および第4図はそれぞれ本発明の送信部と
受信部の実施例を示すブロツク図である。 1……符号器、2……パリテイ付加回路、3…
…スイツチ、4……誤り訂正復号器、5……誤り
符号語表示回路、6……パリテイ検査回路、7…
…誤り修正回路。
FIG. 1 is an explanatory diagram showing the structure of a transmission code according to the present invention, FIG. 2a is an explanatory diagram also showing the structure of a reception code, and FIG. An explanatory diagram showing
FIGS. 3 and 4 are block diagrams showing embodiments of a transmitting section and a receiving section, respectively, of the present invention. 1... Encoder, 2... Parity addition circuit, 3...
...Switch, 4...Error correction decoder, 5...Error code word display circuit, 6...Parity check circuit, 7...
...Error correction circuit.

Claims (1)

【特許請求の範囲】[Claims] 1 複数の誤り訂正符号語を1ブロツクとし、上
記複数の誤り訂正符号語の同一桁間に付加された
パリテイを持つ信号を受信する手段と、上記複数
の誤り訂正符号語のそれぞれを誤り訂正符号の規
則に従つて誤り訂正する誤り訂正手段と、上記複
数の誤り訂正符号語の内、誤りを含む符号語の位
置を記憶する手段と、上記誤り訂正手段からの符
号語の同一桁間のパリテイを求める手段と、上記
両パリテイが不一致の場合であつて、上記ブロツ
ク内の同一桁よりなる集合内の誤りを含む符号語
の個数が上記パリテイによる訂正能力以下のとき
は上記誤りを含む集合内の誤りを訂正し、上記個
数が上記訂正能力を超えるときは上記誤りを含む
符号語を修正符号で置換する手段とを備えたこと
を特徴とする復号回路。
1 A means for receiving a signal having a plurality of error correction codewords as one block and having parity added between the same digits of the plurality of error correction codewords, and an error correction code for each of the plurality of error correction codewords. an error correction means for correcting errors according to the rules of the above, a means for storing the position of a code word containing an error among the plurality of error correction code words, and a parity between the same digits of the code word from the error correction means. and if the two parities do not match, and the number of code words containing errors in a set of the same digits in the block is less than the correction ability of the parity, A decoding circuit comprising means for correcting errors in the code word and replacing the code word containing the error with a corrected code when the number of errors exceeds the correction capability.
JP11266483A 1983-06-24 1983-06-24 Decoding circuit Granted JPS59131237A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP11266483A JPS59131237A (en) 1983-06-24 1983-06-24 Decoding circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP11266483A JPS59131237A (en) 1983-06-24 1983-06-24 Decoding circuit

Publications (2)

Publication Number Publication Date
JPS59131237A JPS59131237A (en) 1984-07-28
JPH0258815B2 true JPH0258815B2 (en) 1990-12-10

Family

ID=14592388

Family Applications (1)

Application Number Title Priority Date Filing Date
JP11266483A Granted JPS59131237A (en) 1983-06-24 1983-06-24 Decoding circuit

Country Status (1)

Country Link
JP (1) JPS59131237A (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6151253A (en) * 1984-08-20 1986-03-13 Nec Corp Memory error correctng circuit
JPS62245726A (en) * 1986-04-18 1987-10-27 Kenwood Corp Decoder for bch code

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5235952A (en) * 1975-09-16 1977-03-18 Hitachi Ltd Errr detecting unit
JPS53124906A (en) * 1977-04-07 1978-10-31 Sony Corp Transmitting method for digital signal

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5235952A (en) * 1975-09-16 1977-03-18 Hitachi Ltd Errr detecting unit
JPS53124906A (en) * 1977-04-07 1978-10-31 Sony Corp Transmitting method for digital signal

Also Published As

Publication number Publication date
JPS59131237A (en) 1984-07-28

Similar Documents

Publication Publication Date Title
KR960003094B1 (en) Error correction code generator
GB2095440A (en) Digital television signal processing
JPH084233B2 (en) Error correction code decoding device
JPS62177768A (en) Error correcting device
US6138263A (en) Error correcting method and apparatus for information data having error correcting product code block
JP2591242B2 (en) Error detection method
JPH0393316A (en) Error detection correction decoding device
JPH048979B2 (en)
JPH0258815B2 (en)
US6453439B1 (en) Pseudo product code encoding and decoding apparatus and method
JPH0365698B2 (en)
JPH10290216A (en) Method for error-correction decoding and device therefor
US5357526A (en) Method and apparatus for correcting errors of compressed data
JPH0691471B2 (en) Error correction circuit
JP2768723B2 (en) Decryption device
JP3277062B2 (en) Error correction code decoding device
JPH01171327A (en) Decoder
JP3135241B2 (en) Error detection and correction decoding device
JPS6322736B2 (en)
JPS6412127B2 (en)
JP2578740B2 (en) Error correction method
JPS61232726A (en) Error correcting device
JPS6342343B2 (en)
JP2609475B2 (en) Error correction code encoder and decoder and decoding method using the decoder
JPH0654590B2 (en) Reproduction method of digital data