| タイトル | Spatially “Mt. Fuji” Coupled LDPC Codes |
|---|---|
| 著者 | Yuta Nakahara 、Shota Saito 、Toshiyasu Matsushima |
| 年度 | 2016 |
| 形式 | 国際学会 |
| 分野 | 通信路符号化 |
| 掲載雑誌名 | Proceedings of the 2016 International Symposium on Information Theory and Its Applications |
| 掲載号・ページ | pp.201-205 |
| 掲載年 | 2016 |
| 掲載月 | 10 |
| アブスト （日本語） |
2016 International Symposium on Information Theory and its Applications (ISITA2016) 2016年10月30日～2016年11月2日 Monterey, California, USA |
| アブスト （英語） |
A new type of spatially coupled low density parity check (SCLDPC) codes is introduced. These codes have exponentially increasing nodes as position goes to the middle of the chain. We call the codes spatially “Mt. Fuji” coupled LDPC (SFCLDPC) codes because the shape constructed by the number of nodes looks like “Mt. Fuji”. By this structure, the SFCLDPC codes have the rate loss $O(\alpha^{-L})$, while the usual SCLDPC codes have $O(L^{-1})$. In addition, the decoding processes for the SFCLDPC codes are accelerated exponentially fast as the iteration progresses. An infinite length analysis for the SFCLDPC codes with the density evolution and a finite length performance comparison between the SFCLDPC codes and the SCLDPC codes with computer simulations are made. |
| 備考 （日本語） |
|
| 備考 （英語） |
|
| 論文原稿 | |
| 発表資料 |
