Please use this identifier to cite or link to this item:
Title: Iterative SISO and MIMO BEM multi-carrier receivers for high-mobility communications
Authors: Yin, Ruibin
Keywords: Engineering::Electrical and electronic engineering::Wireless communication systems
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Yin, R. (2022). Iterative SISO and MIMO BEM multi-carrier receivers for high-mobility communications. Master's thesis, Nanyang Technological University, Singapore.
Project: ISM-DISS-02444
Abstract: One of important use cases of the sixth generation (6G) mobile communications is high-mobility communication, which poses a challenge for multi-carrier receivers. In this dissertation, two multi-carrier modulation techniques, the conventional popular orthogonal frequency division multiplexing (OFDM) and the recently proposed orthogonal time frequency space (OTFS), are considered, and basis expansion model (BEM) is adopted to model doubly selective fading channel (DSFC) of high-mobility communications. Two iterative single-input single-output (SISO) BEM OFDM and OTFS receivers have been presented in this dissertation. In addition, the iterative SISO BEM OTFS receiver has been extended and adapted to the iterative multiple-input multiple-output (MIMO) BEM OTFS receiver for the sake of higher throughput and data rates. Simulation results show that the BEM OTFS receiver significantly outperforms the BEM OFDM receiver in terms of the mean square error (MSE) of CE and bit error rate (BER). In addition, compared with the SISO case, the iterative MIMO BEM OTFS receiver can improve BER performance at high signal-to-noise ratio (SNR).
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
2.11 MBAdobe PDFView/Open

Page view(s)

Updated on Apr 19, 2024

Download(s) 50

Updated on Apr 19, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.