Wataru Matsumoto

Learn More
  • Koike-Akino, T Kojima, K Millar, D S Parsons, K Kametani, S Sugihara +16 others
Superchannel transmission is a candidate to realize Tb/s-class high-speed optical communications. In order to achieve higher spectrum efficiency, the channel spacing shall be as narrow as possible. However, densely allocated channels can cause nonnegligible inter-channel interference (ICI) especially when the channel spacing is close to or below the Nyquist(More)
  • Koike-Akino, T Millar, D S Kojima, K Parsons, K Miyata, Y Sugihara +6 others
Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of(More)
  • Koike-Akino, T Kojima, K Millar, D S Parsons, K Kametani, S Sugihara +16 others
We propose to use Han-Kobayashi (HK) coding and dirty-paper coding (DPC) to cope with inter-carrier interference (ICI) in dual-carrier transmissions. We show the considerable benefit of those methods to increase throughput in presence of strong ICI for dense carrier spacing. This work may not be copied or reproduced in whole or in part for any commercial(More)
  • T Xia, T Koike-Akino, D S Millar, K Kojima, K Parsons, Y Miyata +10 others
We show a great potential of nonbinary (NB) LDPC convolutional codes in low-latency decoding for HDM. We show that NB-LDPC can provide considerable performance improvement compared to conventional BICM-ID, which requires soft-decision feedback. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in(More)
  • T Xia, T Koike-Akino, D S Millar, K Kojima, K Parsons, Y Miyata +10 others
We propose a dynamic window decoding scheme for LDPC convolutional codes to reduce the latency compared to the belief propagation decoding. The BER performance of our proposed memory-efficient decoding scheme is verified by simulations. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or(More)