Development of Universal Decoding Algorithms for BCH codes and LDPC codes
| Project/Area Number |
15560319
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
UYEMATSU Tomohiko Tokyo Institute of Technology, Graduate School of Science and Engineering, Professor, 大学院・理工学研究科, 教授 (60168656)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KANAYA Fumio Shonan Institute of Technology, Faculty of Engineering, Professor, 工学部, 教授 (90277939)
MATSUMOTO Ryutaroh Tokyo Institute of Technology, Graduate School of Science and Engineering, Associate Professor, 大学院・理工学研究科, 助教授 (10334517)
|
|---|
| Project Period (FY) |
2003 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥2,000,000 (Direct Cost: ¥2,000,000)
Fiscal Year 2004: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 2003: ¥500,000 (Direct Cost: ¥500,000)
|
|---|
| Keywords | additive channel / channel coding / linear code / minimum entropy decoder / multistage coding / decoding / trellis / universal decoder |
|---|
| Research Abstract |
For a given class of linear codes such that BCH codes or LDPC(Low Density Parity Check) codes, we develop universal decoders which do not depend on the statistical characteristics of the discrete memoryless channel, and obtained following results.
1.We investigate the performance of the well-known universal decoder called the minimum entropy decoder. For a class of M-ary additive channels, we have derived an upper bound on the probability of decoding error when the minimum entropy decoder is employed. The obtained bound depends on the weight spectrum of the given code as well as the transition probability of the channel. Further, we have clarified a condition such that the obtained error exponent coincides with the random coding exponent as the block length of the code tends to infinity.
2.In order to reduce the complexity of the universal decoder, we have proposed a new scheme called universal multistage decoder. By combining this decoder with the conventional multilevel coding scheme, the capacity of the channel can be achieved. Further, we also derive an upper bound on the probability of decoding error for a class of M-ary additive channels, when the proposed multistage decoder is employed.
3.We have shown that both the minimum entropy decoder and the universal multistage decoder can be efficiently implemented by using the trellis of the code. We have also clarified the performance of the proposed universal decoder by using computer simulation.
|
Report
(3 results)
Research Products
(2 results)
