Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/78110
Title: | Low-complexity opportunistic interference alignment | Authors: | Chua, Yee Ling | Keywords: | DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems | Issue Date: | 2019 | Abstract: | Interference is deemed to be the most critical issue in every wireless communication network; a high interference can cause major disruptions to the original signal, thereby degrading the quality of a particular transmitted signal. To counteract this issue, we introduce the concept of Interference Alignment (IA) which is aimed at reducing or eradicating all the unwanted interfering signals caused by other users in the vicinity of the desired signal. In our study, we managed to propose three main algorithms: Minimum Generated Interference (Min-GIN), Maximum Signal-to-Noise Ratio (Max-SNR) and Maximum Signal-to-Generated-Interference-plus-Noise Ratio (Max-SGINR). They basically set the selection criteria whereby only two best users from a particular cell will be chosen for the transmission such that the most ideal performance could be simulated. Our proposed algorithms has been proven to be successful in boosting sum-rates per cell thereby, increasing efficiency for the signal to be transmitted. Thus, the implementation of the concept of Opportunistic Interference Alignment (OIA) is proven to be rather promising especially in the real world where there is increasing demand for traffic load with the growing population. | URI: | http://hdl.handle.net/10356/78110 | Schools: | School of Electrical and Electronic Engineering | Rights: | Nanyang Technological University | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | EEE Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FYP Final Report_Chua Yee Ling.pdf Restricted Access | 2.29 MB | Adobe PDF | View/Open |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.