| Project/Area Number |
22560375
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2010: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | 通信路分極 / ポーラ符号 / 通信路容量 / 通信路符号化 / 情報通信工学 / 誤り訂正符号 |
|---|
| Research Abstract |
Polar codes combined with successive-cancellation decoding, that were newly proposed in 2008, have been attracting attentions of researchers as error-correcting codes that have been proven to saturate the symmetric capacity for any memoryless channel in the limit of long codelength, while requiring relatively low computational complexity in encoding and decoding. In this research project, aiming at obtaining understandings that will be useful in constructing codes with better performance, we have elucidated the phenomenon of channel polarization, which lays the mathematical basis for high performance of polar codes. We have obtained a result on asymptotic decoding error probability in a coderate-dependent form, by refining existing asymptotic results on decoding error probability. We have also studied channel polarization over non-binary alphabet, and have obtained a necessary and sufficient condition for an invertible ?×? matrix on Fq to induce channel polarization.
|
