It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
A The next generation of wireless systems, like 5G/6G, ought to accommodate a wide range of potential use cases like massive real-time and machine-type communications. Accordingly, such systems need to provide high throughput, low latency, and a low peak to average power ratio (PAPR). It is not feasible to fulfil each of these needs with a single 5G/6G technique. On one hand, MIMO technique can potentially improve spectral efficiency and hence support more date rates. On the other hand, the utilization of multi-carriers’ techniques like FBMC/OQAM, or offset quadrature amplitude modulation, offers a compelling substitute for the traditional cyclic prefix-based orthogonal frequency division multiplexing (CP-OFDM) because of its excellent spectral efficiency and extremely low out-of-band radiation. However, the FBMC/OQAM orthogonality constraint is loosened, confined to the real field alone, resulting in intrinsic interference. This interference causes incompatibilities between FBMC/OQAM and certain MIMO schemes. Also, equalizing the time-varying MIMO channel is even more difficult when the complex valued symbol—which includes both real and imaginary FBMC/OQAM task, primarily due to the general non-flatness of the subchannels. From this perspective, we first suggest in this paper an efficient pruned-DFT-based implementation of MIMO to restoring the complex orthogonality and also reduce the complexity of the whole system. Then, we optimize MIMO channel equalization by efficiently separating and equalizing multiple parallel channels using various equalization techniques. The numerical results, presented as MSE versus subcarrier index, show that Pruned DFT technique consistently achieves lower MSE values compared to the standard MIMO FBMC-OQAM across various configurations, which indicates better error performance and its robustness in dynamic channel conditions.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer