Full Text Views
119
This paper proposes a parallel peak cancellation (PC) process for the computational complexity-efficient algorithm called PC with a channel-null constraint (PCCNC) in the adaptive 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. By simultaneously adding multiple PC signals to the time-domain transmission signal vector, the required number of iterations of the iterative algorithm is effectively reduced along with the PAPR. We implement a constraint in which the PC signal is transmitted only to the null space in the MIMO channel by beamforming (BF). By doing so the data streams do not experience interference from the PC signal on the receiver side. Since the fast Fourier transform (FFT) and inverse FFT (IFFT) operations at each iteration are not required unlike the previous algorithm and thanks to the newly introduced parallel processing approach, the enhanced PCCNC algorithm reduces the required total computational complexity and number of iterations compared to the previous algorithms while achieving the same throughput-vs.-PAPR performance.
Taku SUZUKI
Tokyo University of Science
Mikihito SUZUKI
Tokyo University of Science
Kenichi HIGUCHI
Tokyo University of Science
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Taku SUZUKI, Mikihito SUZUKI, Kenichi HIGUCHI, "Parallel Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Transmission" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 5, pp. 539-549, May 2021, doi: 10.1587/transcom.2020EBT0008.
Abstract: This paper proposes a parallel peak cancellation (PC) process for the computational complexity-efficient algorithm called PC with a channel-null constraint (PCCNC) in the adaptive 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. By simultaneously adding multiple PC signals to the time-domain transmission signal vector, the required number of iterations of the iterative algorithm is effectively reduced along with the PAPR. We implement a constraint in which the PC signal is transmitted only to the null space in the MIMO channel by beamforming (BF). By doing so the data streams do not experience interference from the PC signal on the receiver side. Since the fast Fourier transform (FFT) and inverse FFT (IFFT) operations at each iteration are not required unlike the previous algorithm and thanks to the newly introduced parallel processing approach, the enhanced PCCNC algorithm reduces the required total computational complexity and number of iterations compared to the previous algorithms while achieving the same throughput-vs.-PAPR performance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020EBT0008/_p
Copy
@ARTICLE{e104-b_5_539,
author={Taku SUZUKI, Mikihito SUZUKI, Kenichi HIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Parallel Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Transmission},
year={2021},
volume={E104-B},
number={5},
pages={539-549},
abstract={This paper proposes a parallel peak cancellation (PC) process for the computational complexity-efficient algorithm called PC with a channel-null constraint (PCCNC) in the adaptive 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. By simultaneously adding multiple PC signals to the time-domain transmission signal vector, the required number of iterations of the iterative algorithm is effectively reduced along with the PAPR. We implement a constraint in which the PC signal is transmitted only to the null space in the MIMO channel by beamforming (BF). By doing so the data streams do not experience interference from the PC signal on the receiver side. Since the fast Fourier transform (FFT) and inverse FFT (IFFT) operations at each iteration are not required unlike the previous algorithm and thanks to the newly introduced parallel processing approach, the enhanced PCCNC algorithm reduces the required total computational complexity and number of iterations compared to the previous algorithms while achieving the same throughput-vs.-PAPR performance.},
keywords={},
doi={10.1587/transcom.2020EBT0008},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Parallel Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Transmission
T2 - IEICE TRANSACTIONS on Communications
SP - 539
EP - 549
AU - Taku SUZUKI
AU - Mikihito SUZUKI
AU - Kenichi HIGUCHI
PY - 2021
DO - 10.1587/transcom.2020EBT0008
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2021
AB - This paper proposes a parallel peak cancellation (PC) process for the computational complexity-efficient algorithm called PC with a channel-null constraint (PCCNC) in the adaptive 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. By simultaneously adding multiple PC signals to the time-domain transmission signal vector, the required number of iterations of the iterative algorithm is effectively reduced along with the PAPR. We implement a constraint in which the PC signal is transmitted only to the null space in the MIMO channel by beamforming (BF). By doing so the data streams do not experience interference from the PC signal on the receiver side. Since the fast Fourier transform (FFT) and inverse FFT (IFFT) operations at each iteration are not required unlike the previous algorithm and thanks to the newly introduced parallel processing approach, the enhanced PCCNC algorithm reduces the required total computational complexity and number of iterations compared to the previous algorithms while achieving the same throughput-vs.-PAPR performance.
ER -