Geometrical decoding algorithm and the correcting limit of high-dimensional hypercubic ring code: Correction ability at BER of 10 super(-1) to 10 super(-2)
In this paper, a new decoding algorithm is proposed in which high-dimensional coding is done in a parity check code (high-dimensional ring code). The decoding method for the previously reported ring code has a complex correcting algorithm and requires much calculation time. We have focused on the po...
Uloženo v:
| Vydáno v: | Electronics & communications in Japan. Part 3, Fundamental electronic science Ročník 84; číslo 5; s. 75 - 85 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.01.2001
|
| ISSN: | 1042-0967 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, a new decoding algorithm is proposed in which high-dimensional coding is done in a parity check code (high-dimensional ring code). The decoding method for the previously reported ring code has a complex correcting algorithm and requires much calculation time. We have focused on the point that a high-dimensional ring code can be divided into a number of two-dimensional ring codes, and by repeating the error correction of two-dimensional ring codes that requires small computation, we can perform error correction of high-dimensional ring codes. This decoding algorithm has a correction ability similar to the conventional decoding algorithms but with less computation. Moreover, when the error rate is high, random error and burst errors are mixed and an error correcting code is needed. However, since the decoding algorithm of the proposed code has a provision for dimensional division and the error generated on the transmitted block can be uniformly distributed on each two-dimensional plane, the error on the channel in the two-dimensional plane becomes random and error correction can be done efficiently. Moreover, if analysis or simulation increases the number of dimensions, then the correction ability is increased and the limit of the correction ability is determined from the size m of the code. The performance of convolutional codes and Reed Solomon codes is compared and it is shown that the ring code has high processing gain of error correction and that if the threshold point of correction lies in the high-error-rate region, then the decoding error rate is small and this code can be applied to high-error-rate correction. copyright 2001 Scripta Technica. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 content type line 23 ObjectType-Feature-1 |
| ISSN: | 1042-0967 |