Name
Title | ||
|---|---|---|
Fast Decoding of the (47, 24, 11) Quadratic Residue Code Without Determining the Unknown Syndromes |
Abstract | ||
|---|---|---|
In this paper, a hard-decision (HD) scheme is presented to facilitate faster decoding of the (47, 24, 11) quadratic residue (QR) code. The new HD algorithm uses the previous scheme of decoding the (47, 24, 11) QR code up to three errors, but corrects four and five errors with new different methods. In the four-error case, the new algorithm directly determines the coefficients of the error-locator polynomial by eliminating unknown syndromes in Newton identities and simplifies the condition that exactly indicates the occurrence of four errors. Subsequently, the reliability-based shift-search algorithm can be utilized to decode weight-5 error patterns. In other words, a five-error case can be decoded in terms of a four-error case after inverting an incorrect bit of the received word. Simulation results show that the new HD algorithm not only significantly reduces the decoding complexity in terms of CPU time but also saves a lot of memory while maintaining the same error-rate performance. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/LCOMM.2015.2440263 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,High definition video,Polynomials,Signal to noise ratio,Simulation,Bit error rate,Reliability | Quadratic residue code,Quadratic residue,Sequential decoding,Berlekamp–Welch algorithm,Polynomial,Computer science,Algorithm,Decoding methods,List decoding,Newton's identities | Journal |
Volume | Issue | ISSN |
19 | 8 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pengwei Zhang | 1 | 0 | 0.68 |
| Yong Li | 2 | 9 | 6.31 |
| Hsin-Chiu Chang | 3 | 33 | 7.58 |
| Hongqing Liu | 4 | 45 | 28.77 |
| Trieu-Kien Truong | 5 | 382 | 59.00 |