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...
Gespeichert in:
| Veröffentlicht in: | Electronics & communications in Japan. Part 3, Fundamental electronic science Jg. 84; H. 5; S. 75 - 85 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
01.01.2001
|
| ISSN: | 1042-0967 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Hata, M Takumi, I Yamaguchi, E Kuroda, S |
| Author_xml | – sequence: 1 givenname: S surname: Kuroda fullname: Kuroda, S – sequence: 2 givenname: E surname: Yamaguchi fullname: Yamaguchi, E – sequence: 3 givenname: I surname: Takumi fullname: Takumi, I – sequence: 4 givenname: M surname: Hata fullname: Hata, M |
| BookMark | eNqNjLFuAjEQRF0QCUj4h61QKE7yHeEIKYNIqKP0yPiW80a2F-y9gm_Jz-ZOokhJNTOaeTNVo8gRR2pS6peq0Jt6PVbTnH-07v1qOVG_n8gBJZE1Hhq03FBswfiWE4kLYGID4hAsp4RWhtJTIAE-gaPWFQ0FjJk49ry7njHZ7kgW0rDs3_ANtjeUI5gjeZIrGIH33dfwUWrIXU89F-UChP_lavGkHk7GZ5zd9FHNP3bf231xTnzpMMshULbovYnIXT5U9XpVv-rN8u7hH6FGXJg |
| ContentType | Journal Article |
| DBID | 7SP 8FD L7M |
| DatabaseName | Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | Technology Research Database Electronics & Communications Abstracts Advanced Technologies Database with Aerospace |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 85 |
| GroupedDBID | .3N .GA .Y3 10A 1OB 1OC 31~ 51W 51X 52N 52O 52P 52S 52T 52W 52X 5VS 7PT 7SP 8-1 8FD AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAXRX AAYCA AAZKR ABCUV ABDBF ABIJN ABJNI ACAHQ ACBWZ ACCZN ACGFS ACPOU ACRPL ACUHS ACXBN ACXQS ACYXJ ADEOM ADIZJ ADMGS ADNMO ADOZA AEFGJ AEIGN AEIMD AEUYR AFBPY AFFPM AFGKR AFWVQ AFZJQ AGQPQ AGXDD AGYGG AHBTC AI. AIDQK AIDYY AITYG AIURR ALMA_UNASSIGNED_HOLDINGS ALUQN AMBMR AMYDB ASPBG ATUGU AVWKF AZFZN BDRZF BFHJK BRXPI BY8 CMOOK DCZOG DR2 DRFUL DRSTM EBS EJD ESX FEDTE G-S GNP GODZA HF~ HGLYW HVGLF IX1 KQQ L7M LATKE LAW LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LYRES MK~ ML~ MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM P4D QB0 ROL SUPJJ TUS UB1 VH1 W99 WH7 WIH WIK WQJ XG1 XV2 ZZTAW |
| ID | FETCH-proquest_miscellaneous_267568093 |
| ISSN | 1042-0967 |
| IngestDate | Thu Jul 10 22:39:13 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-proquest_miscellaneous_267568093 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 content type line 23 ObjectType-Feature-1 |
| PQID | 26756809 |
| PQPubID | 23500 |
| ParticipantIDs | proquest_miscellaneous_26756809 |
| PublicationCentury | 2000 |
| PublicationDate | 20010101 |
| PublicationDateYYYYMMDD | 2001-01-01 |
| PublicationDate_xml | – month: 01 year: 2001 text: 20010101 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Electronics & communications in Japan. Part 3, Fundamental electronic science |
| PublicationYear | 2001 |
| SSID | ssj0009653 |
| Score | 2.9351451 |
| Snippet | 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... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| StartPage | 75 |
| Title | 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) |
| URI | https://www.proquest.com/docview/26756809 |
| Volume | 84 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 issn: 1042-0967 databaseCode: DRFUL dateStart: 19970101 customDbUrl: isFulltext: true dateEnd: 20071231 titleUrlDefault: https://onlinelibrary.wiley.com omitProxy: false ssIdentifier: ssj0009653 providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6lgQMcEE_xZg4UUUVGtjfJ2tygTahQCKgyUjhFa3vdRiR2cOyq_BZ-Dn-MmbUdb-BQOHCxko0zcjKfduf1zTD2XHrCVy66JX7s9K2-rxIr9ERiJYIPE_ys7whNFJ6I6dSbzfxPnc7PhgtzvhRp6l1c-Ov_qmpcQ2UTdfYf1L0Vigv4GpWOV1Q7Xv9K8e9UtqIxWTr9gs6lZq3I5WmWL4qz1bZiMqKxHJEuel4SyUlbjeipWzH1-696dfTO0EvNozKkPs8VOzfWXPbD-stUyqyra78TKfLt6ISkOHZvU64JCug5UtQBzVtzzW2iD01CYDuJZ6OBGJmcFV2u-x5P9PQVWrt50ePa3Cb-Sj2WwBjkUx_nRnoqi-VOfPeLXMlTmv-yQ8II5NdytdiJIR_Lyqz-sBMWcYywSLWTE-8I_TNhbvXVNLoa0gNj366mtzQWwKA9HJuCgOnH-fjzZDIPRrNgn4_X3ywaXEYJ_n1-VIFoj-1xu99lV45O8Na28_NwULE86uf549DXlkxwk92oXRB4U0HnFuuo9Da7bjSmvMN-GCCCBkSwBREgiABBBC2IQIMIsgR-BxG0IAKSDgSi19BCCGoIgSwAIUQyHBs0XF5azgEUmfHePbjLXoxHweGx1fy-OW5VlH-SqcrKzdxF53To2T6_x7pplqr7DJQ9jF0RJ26Ef13MeehwEfq4u4W2o8IkfMCeXSLs4aV3PGLXWoA8Zt0iL9UTdjU6Lxab_Gmtrl9Lmodz |
| linkProvider | Wiley-Blackwell |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Geometrical+decoding+algorithm+and+the+correcting+limit+of+high-dimensional+hypercubic+ring+code%3A+Correction+ability+at+BER+of+10+super%28-1%29+to+10+super%28-2%29&rft.jtitle=Electronics+%26+communications+in+Japan.+Part+3%2C+Fundamental+electronic+science&rft.au=Kuroda%2C+S&rft.au=Yamaguchi%2C+E&rft.au=Takumi%2C+I&rft.au=Hata%2C+M&rft.date=2001-01-01&rft.issn=1042-0967&rft.volume=84&rft.issue=5&rft.spage=75&rft.epage=85&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1042-0967&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1042-0967&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1042-0967&client=summon |