|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC, ISEC, IT, WBS |
2024-03-13 14:40 |
Osaka |
Osaka Univ. (Suita Campus) |
Sparse Superposition Codes Using Second Order Reed-Muller: Orthogonal Encoding Tsukasa Osaka (Doshisha Univ.), Guanghui Song (Xidian Univ.), Tomotaka Kimura, Jun Cheng (Doshisha Univ.) IT2023-92 ISEC2023-91 WBS2023-80 RCC2023-74 |
A family of block orthogonal sparse superposition codes is proposed. The dictionary matrix consists of
all the second o... [more] |
IT2023-92 ISEC2023-91 WBS2023-80 RCC2023-74 pp.108-113 |
RCS, SR, SRW (Joint) |
2021-03-05 10:30 |
Online |
Online |
A Study on Trainable Gaussian Belief Propagation Using Deep Unfolding for Large NOMA Detection Ryuichi Kume, Shinsuke Ibi (Doshisha Univ.), Takumi Takahashi (Osaka Univ.), Hisato Iwai (Doshisha Univ.) RCS2020-255 |
This paper compares transmission characteristics of sparse code multiple access (SCMA) and sparse superposition code (SS... [more] |
RCS2020-255 pp.240-245 |
IT |
2020-12-03 13:40 |
Online |
Online |
Downlink Non-Orthogonal Multiple Access (NOMA) Using sparse superposition codes Hayato Tachiwana, Yutaka Jitsumatsu (Kyushu Univ.) IT2020-54 |
Non-orthogonal multiple access (NOMA) is considered to be a most promising next generation mobile communication systems.... [more] |
IT2020-54 pp.159-164 |
RCS |
2020-06-26 11:15 |
Online |
Online |
A Study on Gaussian Belief Propagation for Sparse Superposition Code in Massive NOMA Detection Ryuichi Kume, Shinsuke Ibi (Doshisha Univ.), Takumi Takahashi (Osaka Univ.), Hisato Iwai (Doshisha Univ.) RCS2020-45 |
In this paper, we propose an iterative detection strategy of Gaussian belief propagation (GaBP) for non-orthogonal multi... [more] |
RCS2020-45 pp.133-138 |
IT, EMM |
2020-05-28 16:00 |
Online |
Online |
[Invited Talk]
Analysis of damping AMP for sparse recovery and its deep unfolding Kazushi Mimura (Hiroshima City Univ.), Takeshi Mori, Jun'ichi Takeuchi (Kyushu Univ.) IT2020-5 EMM2020-5 |
We explain recent progress on damping for iterative algorithms. We analyze the damped AMP and investigate property of AM... [more] |
IT2020-5 EMM2020-5 pp.25-30 |
CS, CAS |
2020-02-28 10:50 |
Kumamoto |
|
Sparse superposition codes in massive machine type communications Hayato Tachiwana, Yutaka Jitsumatsu (Kyushu Univ.) CAS2019-117 CS2019-117 |
[more] |
CAS2019-117 CS2019-117 pp.111-115 |
IT, SIP, RCS |
2020-01-23 14:20 |
Hiroshima |
Hiroshima City Youth Center |
Analysis of damping in AMP by unrolling Takeshi Mori (Kyushu Univ), Kazushi Mimura (Hiroshima City Univ), Jun'Ichi Takeuchi (Kyushu Univ) IT2019-51 SIP2019-64 RCS2019-281 |
Damping for iterative algorithms such as approximate message passing (AMP) is a technique to stabilize behavior of the a... [more] |
IT2019-51 SIP2019-64 RCS2019-281 pp.93-98 |
MIKA (2nd) |
2019-10-03 11:15 |
Hokkaido |
Hokkaido Univ. |
[Poster Presentation]
Error Probability Performance of a multiple access system using sparse superposition codes Hayato Tachiwana, Yutaka Jitsumatsu (Kyushu Univ.) |
Sparse Code Multiple Access (SCMA), which is one of the machine type communication methods in mobile communication, avoi... [more] |
|
WBS, IT, ISEC |
2018-03-09 09:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Bayes Optimal AMP Decoder for Sparse Superposition Codes Yuwa Hatae (Kyushu Univ.), Kazushi Mimura (Hiroshima City Univ.), Masanori Kawakita, Jun'ichi Takeuchi (Kyushu Univ.) IT2017-127 ISEC2017-115 WBS2017-108 |
Sparse superposition codes (SS codes), proposed by Barron and Joseph
in 2010, are
a class of error-correcting codes f... [more] |
IT2017-127 ISEC2017-115 WBS2017-108 pp.143-148 |
IT |
2012-09-28 10:15 |
Gunma |
Kusatsu Seminar House |
Sparse Superposition Codes with Bernoulli Dictionary Yoshinari Takeishi, Masanori Kawakita, Jun'ichi Takeuchi (Kyushu Univ.) IT2012-38 |
We study some extension of the sparse superposition codes proposed by Barron and Joseph in 2010. The original sparse sup... [more] |
IT2012-38 pp.41-46 |
|
|
|
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)
|
[Return to Top Page]
[Return to IEICE Web Page]
|