Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2012-09-28 11:05
Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods
Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.) IT2012-40
Abstract (in Japanese) (See Japanese page) 
(in 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.
Keyword (in Japanese) (See Japanese page) 
(in English) multiple-access channel / linear programming decoding / dual decomposition method / augmented Lagrangian method / alternation direction method of multipliers (ADMM) / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 215, IT2012-40, pp. 53-58, Sept. 2012.
Paper # IT2012-40 
Date of Issue 2012-09-20 (IT) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF IT2012-40

Conference Information
Committee IT  
Conference Date 2012-09-27 - 2012-09-28 
Place (in Japanese) (See Japanese page) 
Place (in English) Kusatsu Seminar House 
Topics (in Japanese) (See Japanese page) 
Topics (in English) error correcting codes, general 
Paper Information
Registration To IT 
Conference Code 2012-09-IT 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods 
Sub Title (in English)  
Keyword(1) multiple-access channel  
Keyword(2) linear programming decoding  
Keyword(3) dual decomposition method  
Keyword(4) augmented Lagrangian method  
Keyword(5) alternation direction method of multipliers (ADMM)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shunsuke Horii  
1st Author's Affiliation Waseda University (Waseda Univ.)
2nd Author's Name Toshiyasu Matsushima  
2nd Author's Affiliation Waseda University (Waseda Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2012-09-28 11:05:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2012-40 
Volume (vol) vol.112 
Number (no) no.215 
Page pp.53-58 
#Pages 6 
Date of Issue 2012-09-20 (IT) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan