Iterative Soft-Decision Decoding of Binary Cyclic Codes
Abstract: Binary cyclic codes achieve good error correction performance and allow the implementation of very simple encoder and decoder circuits. Among them, BCH codes represent a very important class of t-error correcting codes, with known structural properties and error correction capability. Deco...
| Permalink: | http://skupni.nsk.hr/Record/nsk.NSK01000717309/Details |
|---|---|
| Matična publikacija: |
Journal of communications software and systems 4 (2008), 2 ; str. 142-149 |
| Glavni autor: | Baldi, Marco (-) |
| Ostali autori: | Cancellieri, Giovanni (-), Chiaraluce, Franco |
| Vrsta građe: | Članak |
| Jezik: | eng |
| Predmet: | |
| Online pristup: |
JCOMMS |
| LEADER | 01964caa a2200301 ir4500 | ||
|---|---|---|---|
| 001 | NSK01000717309 | ||
| 003 | HR-ZaNSK | ||
| 005 | 20110209111538.0 | ||
| 007 | ta | ||
| 008 | 091026s2008 ci ||| ||eng | ||
| 035 | |9 (HR-ZaNSK)719883 | ||
| 035 | |a (HR-ZaNSK)000717309 | ||
| 040 | |a HR-ZaNSK |b hrv |c HR-ZaNSK |e ppiak | ||
| 042 | |a croatica | ||
| 080 | |a 621.3 |2 MRF 1998. | ||
| 080 | |a 004 |2 MRF 1998. | ||
| 100 | 1 | |a Baldi, Marco | |
| 245 | 1 | 0 | |a Iterative Soft-Decision Decoding of Binary Cyclic Codes / |c Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce. |
| 300 | |b Ilustr. | ||
| 504 | |a Bibliografija: 14 jed | ||
| 520 | 8 | |a Abstract: Binary cyclic codes achieve good error correction performance and allow the implementation of very simple encoder and decoder circuits. Among them, BCH codes represent a very important class of t-error correcting codes, with known structural properties and error correction capability. Decoding of binary cyclic codes is often accomplished through hard-decision decoders, although it is recognized that soft-decision decoding algorithms can produce significant coding gain with respect to hard-decision techniques. Several approaches have been proposed to implement iterative soft-decision decoding of binary cyclic codes. We study the technique based on "extended parity-check matrices", and show that such method is not suitable for high rates or long codes. We propose a new approach, based on "reduced parity-check matrices" and "spread parity-check matrices", that can achieve better correction performance in many practical cases, without increasing the complexity | |
| 653 | |a Signali |a Kodiranje |a Algoritmi | ||
| 700 | 1 | |a Cancellieri, Giovanni | |
| 700 | 1 | |a Chiaraluce, Franco | |
| 773 | 0 | |t Journal of communications software and systems |x 1845-6421 |g 4 (2008), 2 ; str. 142-149 |w nsk.(HR-ZaNSK)000575599 | |
| 981 | |b B09/08 | ||
| 998 | |a rado091026 |c rpeo110209 | ||
| 856 | 4 | 2 | |u http://lab405.fesb.hr/jcomss/index.php |y JCOMMS |