Spatially 'Mt. Fuji' coupled LDPC codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages201-205
Number of pages5
ISBN (Electronic)9784885523090
Publication statusPublished - 2017 Feb 2
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: 2016 Oct 302016 Nov 2

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period16/10/3016/11/2

Fingerprint

performance comparison
computer simulation
Decoding
Computer simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Cite this

Nakahara, Y., Saito, S., & Matsushima, T. (2017). Spatially 'Mt. Fuji' coupled LDPC codes. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 201-205). [7840414] Institute of Electrical and Electronics Engineers Inc..

Spatially 'Mt. Fuji' coupled LDPC codes. / Nakahara, Yuta; Saito, Shota; Matsushima, Toshiyasu.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 201-205 7840414.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nakahara, Y, Saito, S & Matsushima, T 2017, Spatially 'Mt. Fuji' coupled LDPC codes. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840414, Institute of Electrical and Electronics Engineers Inc., pp. 201-205, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.
Nakahara Y, Saito S, Matsushima T. Spatially 'Mt. Fuji' coupled LDPC codes. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 201-205. 7840414
Nakahara, Yuta ; Saito, Shota ; Matsushima, Toshiyasu. / Spatially 'Mt. Fuji' coupled LDPC codes. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 201-205
@inproceedings{acc60929174e4392af3ed4ab25f99b40,
title = "Spatially 'Mt. Fuji' coupled LDPC codes",
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.",
author = "Yuta Nakahara and Shota Saito and Toshiyasu Matsushima",
year = "2017",
month = "2",
day = "2",
language = "English",
pages = "201--205",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Spatially 'Mt. Fuji' coupled LDPC codes

AU - Nakahara, Yuta

AU - Saito, Shota

AU - Matsushima, Toshiyasu

PY - 2017/2/2

Y1 - 2017/2/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85015147938&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015147938&partnerID=8YFLogxK

M3 - Conference contribution

SP - 201

EP - 205

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -