| Presentation | 2019-11-20 A Study on Low-Complexity Data Detection for Grant-Free Non-Orthogonal Multiple Access Takanori Hara, Koji Ishibashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | As a scheme to accommodate a large number of users efficiently, the grant-free non-orthogonal multiple access (GF-NOMA) based on boosted approximate message passing (Boosted AMP), has been proposed. This scheme converts the original reconstruction problem into the smaller sized one by multiplying random matrices and perform the channel estimation (CE) and date detection via minimum mean-squared error (MMSE) estimation after the active user detection (AUD). However, the performance degrades owing to the problem conversion, and the computational complexity of MMSE estimation is still high. In this paper, we propose the modified problem conversion to perform AUD and CE jointly and reduce the complexity of data detection by exploiting the conjugate gradient method. Furthermore, we show that our proposal can attain superior performance than the conventional scheme by modifying the threshold for AUD, while its computational complexity decreases. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Grant-free non-orthogonal multiple access / data detection / compressed sensing / approximate message passing |
| Paper # | RCS2019-211 |
| Date of Issue | 2019-11-13 (RCS) |
| Conference Information | |
| Committee | AP / RCS |
|---|---|
| Conference Date | 2019/11/20(3days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Saga Univ. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Adaptive Antenna, Equalization, Interference Canceler, MIMO, Wireless Communications, etc. |
| Chair | Qiang Chen(Tohoku Univ.) / Tomoaki Otsuki(Keio Univ.) |
| Vice Chair | Satoru Kurokawa(AIST) / Satoshi Suyama(NTT DoCoMo) / Fumiaki Maehara(Waseda Univ.) / Toshihiko Nishimura(Hokkaido Univ.) |
| Secretary | Satoru Kurokawa(Mitsubishi Electric) / Satoshi Suyama(Tokyo Univ. of Agric. & Tech.) / Fumiaki Maehara(NTT) / Toshihiko Nishimura(Kyushu Univ.) |
| Assistant | Michitaka Ameya(AIST) / Kazushi Muraoka(NEC) / Shinsuke Ibi(Doshisha Univ.) / Koichi Adachi(Univ. of Electro-Comm.) / Osamu Nakamura(Sharp) / Manabu Sakai(Mitsubishi Electric) |
| Paper Information | |
| Registration To | Technical Committee on Antennas and Propagation / Technical Committee on Radio Communication Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Study on Low-Complexity Data Detection for Grant-Free Non-Orthogonal Multiple Access |
| Sub Title (in English) | |
| Keyword(1) | Grant-free non-orthogonal multiple access |
| Keyword(2) | data detection |
| Keyword(3) | compressed sensing |
| Keyword(4) | approximate message passing |
| 1st Author's Name | Takanori Hara |
| 1st Author's Affiliation | The University of Electro-Communications(The Univ. of Electro-Communications) |
| 2nd Author's Name | Koji Ishibashi |
| 2nd Author's Affiliation | The University of Electro-Communications(The Univ. of Electro-Communications) |
| Date | 2019-11-20 |
| Paper # | RCS2019-211 |
| Volume (vol) | vol.119 |
| Number (no) | RCS-296 |
| Page | pp.pp.49-54(RCS), |
| #Pages | 6 |
| Date of Issue | 2019-11-13 (RCS) |