Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS |
2021-06-25 09:20 |
Online |
Online |
QoS-aware Low-complexity User Pairing Based on Compressed Sensing in Downlink NOMA Tomofumi Makita, Osamu Muta (Kyushu Univ.) RCS2021-63 |
Downlink non-orthogonal multiple access (NOMA) systems with successive interference cancellation requires an effective u... [more] |
RCS2021-63 pp.196-201 |
RCS |
2021-06-25 13:10 |
Online |
Online |
Multiple Measurement Vector Approximate Message Passing Without Prior Information of Channels for Grant-Free Non-Orthogonal Multiple Access Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2021-71 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] |
RCS2021-71 pp.243-248 |
RCS, SR, SRW (Joint) |
2021-03-03 10:35 |
Online |
Online |
Non-Orthogonal Multiple Access that allocates subcarriers based on factor graphs Taichi Yamagami, Satoshi Denno, Ahi Ko (Okayama Univ.) SRW2020-52 |
In this paper, we propose a non-orthogonal multiple access in the frequency domain. In the proposed method, multiple use... [more] |
SRW2020-52 pp.7-13 |
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 |
SIP, IT, RCS |
2021-01-22 09:50 |
Online |
Online |
Selection of Interference Cancellation Technique Using Decision Trees for Uplink Non-orthogonal Multiple Access
-- Evaluation of Communication Success Rate in A Mobile Environment -- Noriaki Yamamoto (Meiji Univ.), Masafumi Moriyama, Kenichi Takizawa (NICT), Tetsushi Ikegami (Meiji Univ.) IT2020-85 SIP2020-63 RCS2020-176 |
As IoT(Internet of Things)develops, wireless access techniques that can effectively accommodate massive number of device... [more] |
IT2020-85 SIP2020-63 RCS2020-176 pp.119-124 |
SIP, IT, RCS |
2021-01-22 10:15 |
Online |
Online |
Proposal of a Method for Reducing the Amount of Calculation for Downlink Non-orthogonal Multiple Access Yohei Ishii, Toshinori Suzuki, Hideki Yoshikawa (Tohoku Gakuin Univ) IT2020-86 SIP2020-64 RCS2020-177 |
In this paper, we propose a method to reduce the amount of calculation, which has been a problem in the conventional met... [more] |
IT2020-86 SIP2020-64 RCS2020-177 pp.125-130 |
OCS, CS (Joint) |
2021-01-15 16:15 |
Online |
Online |
Demonstration of Nonlinear Quantizer for Power Domain Non-Orthogonal Multiple Access PON Kosuke Suzuoki, Daisuke Hisano, Sho Shibita (OU), Kazuki Maruta (TIT), Akihiro Maruta (OU) CS2020-77 |
The application of power-domain non-orthogonal multiple access (PD-NOMA) to PON has been studied to increase the number ... [more] |
CS2020-77 pp.8-13 |
NS, RCS (Joint) |
2020-12-17 11:00 |
Online |
Online |
[Encouragement Talk]
Massive Grant-Free Non-Orthogonal Multiple Access Utilizing Time and Frequency Spreading Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2020-134 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] |
RCS2020-134 pp.1-6 |
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 |
RCS, SR, SRW (Joint) |
2020-03-04 10:55 |
Tokyo |
Tokyo Institute of Technology (Cancelled but technical report was issued) |
Transmission Efficiency of Uplink Grant-Free Non-Orthogonal Multiple Access Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-325 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access (GF-NOMA) has gained much ... [more] |
RCS2019-325 pp.31-36 |
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-24 10:45 |
Hiroshima |
Hiroshima City Youth Center |
Study on application of low complexity chaos NOMA-SIC decoding method in uplink Yoshihiro Masuda, Eiji Okamoto (NIT), Tetsuya Yamamoto (Panasonic) IT2019-63 SIP2019-76 RCS2019-293 |
Non-orthogonal multiple access (NOMA) scheme has been studied as one of the methods to perform larger capacity and high ... [more] |
IT2019-63 SIP2019-76 RCS2019-293 pp.155-160 |
IT, SIP, RCS |
2020-01-24 14:50 |
Hiroshima |
Hiroshima City Youth Center |
Inter-Base Station Cooperative NOMA Among Multiple Downlink Service Channels to Maximize Integrated System Throughput Teruaki Shikuma, Kenichi Higuchi (Tokyo Univ. of Science) IT2019-78 SIP2019-91 RCS2019-308 |
We propose a non-orthogonal multiple access (NOMA)-based inter-base station (BS) cooperative scheduling method among ter... [more] |
IT2019-78 SIP2019-91 RCS2019-308 pp.247-253 |
IT, SIP, RCS |
2020-01-24 16:40 |
Hiroshima |
Hiroshima City Youth Center |
Active User Detection for Uplink Grant-Free Non-Orthogonal Multiple Access in The Presence of Carrier Frequency Offsets Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) IT2019-89 SIP2019-102 RCS2019-319 |
Practically, it is significantly difficult to assume that carrier frequencies are ideally synchronized among users, and ... [more] |
IT2019-89 SIP2019-102 RCS2019-319 pp.313-317 |
NS, RCS (Joint) |
2019-12-19 09:15 |
Tokushima |
Tokushima Univ. |
A Study on Active User Detection and Channel Estimation for Grant-Free Non-Orthogonal Multiple Access based on OFDM Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-237 |
As a scheme to accommodate a large number of users efficiently, the grant-free non-orthogonal multiple access (GF-NOMA) ... [more] |
RCS2019-237 pp.1-5 |
AP, RCS (Joint) |
2019-11-20 13:35 |
Saga |
Saga Univ. |
A Study on Low-Complexity Data Detection for Grant-Free Non-Orthogonal Multiple Access Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-211 |
As a scheme to accommodate a large number of users efficiently, the grant-free non-orthogonal multiple access (GF-NOMA) ... [more] |
RCS2019-211 pp.49-54 |
RCS |
2019-10-24 09:55 |
Kanagawa |
Yokosuka Research Park |
Theoretical Analysis on Grant-Free Non-Orthogonal Multiple Access Using Vector Approximate Message Passing Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-179 |
As a scheme to accommodate a large number of users efficiently, the grant-free non-orthogonal multiple
access (GF-NOMA)... [more] |
RCS2019-179 pp.7-12 |
MIKA (2nd) |
2019-10-04 12:15 |
Hokkaido |
Hokkaido Univ. |
[Invited Lecture]
Performance improvement of 5G IoT wireless communication using nonlinear signal processing Eiji Okamoto (NITech) |
In addition to a traditional use case of high-capacity communication, the fifth generation mobile communications system ... [more] |
|
RCS, SAT (Joint) |
2019-08-22 09:25 |
Aichi |
Nagoya University |
A Study on a Performance Improvement by Cyclic Redundancy Check for Large-Scale SCMA Detection Renjie Li, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa, Junichiro Hagiwara (Hokkaido Univ.) RCS2019-147 |
SCMA attracts attention as a non-orthogonal multiple access method for device-to-device communi- cation. Generally, NOMA... [more] |
RCS2019-147 pp.7-12 |