1. [Home]
  2. [Research achievement]
  3. [Research achievement detail]

Research achievement detail

Title Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods (in Japanese)
Authors Shunsuke Horii 、Toshiyasu Matsushima
Released Year 2012
Format Conference
Category Channel coding
Jounal Name IEICE Technical Report
Jounal Page vol.112, no.215, IT2012-40, pp.53-58
Published Year 2012
Published Month 9
Abstract
(English)
In this paper, we develop a dual decomposition method based linear-programming (LP) decoding for
multiple-access channels with binary linear codes. LP decoding has decoding error rate which is comparable with state-of-the-art Sum-Product decoder for the decoding problem of binary linear codes with stronger theoretical guarantees and it is applied to decoding problems over various channels such as interference channels and multiple-access channels. But the decoder has to solve an LP problem and in general its computational complexity is the polynomial order of the number of variables and the number of constraints. Therefore it needs more decoding time compared to other decoders such as Sum-Product decoder. In order to tackle the complexity problem, many complexity efficient decoders have been developed for single-user memoryless channels. Especially, some previous studies showed that the decoding algorithm based on dual decomposition works well for large scale LDPC codes.
In this paper, we apply the dual decomposition methods for the decoding problem over multiple access channels.
Note
(English)
1
Manuscript
Presentation