| 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 | 2021-06-23 13:20 Investigation on Complexity Reduction in Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel Kenta Hosoi (Tokyo Univ. of Science), Nobuhide Nonaka (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science)  RCS2021-38 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this paper, we propose an algorithm to further reduce the computational complexity of the peak-to-average power ratio (PAPR) reduction method using the null space in a multiple-input multiple-output (MIMO) channel for MIMO-orthogonal frequency division multiplexing (OFDM) signals under frequency-selective fading channel. In the previously reported conventional method, the peak cancellation (PC) signal vector is generated by multiplying basic time-domain pulse signal, which is designed to reduce the same peak signal and whose transmission band is limited to the respective frequency blocks, with a beamforming (BF) vector directed at the null space of the MIMO channel in each frequency block. By averaging the PC signals of all frequency blocks, the wideband PC signal is equivalently generated. However, the conventional method requires the calculation of the projection of the PC signal into the null space of the MIMO channel at all the frequency blocks to suppress single peak per iteration. This leads to the deterioration of the computational complexity-vs.-PAPR reduction performance. The proposed method suppresses multiple peaks simultaneously using the PC signal at each frequency block. In this case, since the PC signal of each frequency block has a narrow band, the peak may regrowth due to the influence of the main lobe spread in the time domain. Therefore, the proposed method adopts a weight control when adding the PC signal to the transmission signal according to the number of repetitions. This weight control successfully suppresses the recurrence of peaks at unexpected timings due to the superposition of narrowband PC signals in each frequency block, and to improve the computational complexity-vs.-PAPR reduction performance. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | PAPR / OFDM / MIMO / null space / peak cancellation / computational complexity reduction / / | |
| Reference Info. | IEICE Tech. Rep., vol. 121, no. 72, RCS2021-38, pp. 56-61, June 2021. | |
| Paper # | RCS2021-38 | |
| Date of Issue | 2021-06-16 (RCS) | |
| ISSN | 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 | RCS2021-38 |
|
| Conference Information | |
| Committee | RCS |
| Conference Date | 2021-06-23 - 2021-06-25 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | First Presentation in IEICE Technical Committee, Resource Control, Scheduling, Wireless Communications, etc. |
| Paper Information | |
| Registration To | RCS |
| Conference Code | 2021-06-RCS |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Investigation on Complexity Reduction in Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel |
| Sub Title (in English) | |
| Keyword(1) | PAPR |
| Keyword(2) | OFDM |
| Keyword(3) | MIMO |
| Keyword(4) | null space |
| Keyword(5) | peak cancellation |
| Keyword(6) | computational complexity reduction |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Kenta Hosoi |
| 1st Author's Affiliation | Tokyo University of Science (Tokyo Univ. of Science) |
| 2nd Author's Name | Nobuhide Nonaka |
| 2nd Author's Affiliation | NTT DOCOMO, INC. (NTT DOCOMO) |
| 3rd Author's Name | Kenichi Higuchi |
| 3rd Author's Affiliation | Tokyo University of Science (Tokyo Univ. of Science) |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2021-06-23 13:20:00 |
| Presentation Time | 10 minutes |
| Registration for | RCS |
| Paper # | RCS2021-38 |
| Volume (vol) | vol.121 |
| Number (no) | no.72 |
| Page | pp.56-61 |
| #Pages | 6 |
| Date of Issue | 2021-06-16 (RCS) |
[Return to Top Page]