Abstract
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(α-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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 201-205 |
| Number of pages | 5 |
| ISBN (Electronic) | 9784885523090 |
| Publication status | Published - 2017 Feb 2 |
| Event | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States Duration: 2016 Oct 30 → 2016 Nov 2 |
Other
| Other | 3rd International Symposium on Information Theory and Its Applications, ISITA 2016 |
|---|---|
| Country/Territory | United States |
| City | Monterey |
| Period | 16/10/30 → 16/11/2 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Information Systems
- Signal Processing
- Library and Information Sciences