Threshold-based Selective Cooperative-NOMA

May 02, 2019 Β· Declared Dead Β· πŸ› IEEE Communications Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ferdi Kara, Hakan Kaya arXiv ID 1905.00768 Category cs.IT: Information Theory Cross-listed eess.SP Citations 36 Venue IEEE Communications Letters Last Checked 6 months ago
Abstract
In this letter, we propose threshold-based selective cooperative-NOMA (TBS-C-NOMA) to increase the data reliability of conventional cooperative-NOMA (C-NOMA) networks. In TBS-C-NOMA, the intra-cell user forwards the symbols of cell-edge user after successive interference canceler (SIC) only if the signal-to-interference plus noise ratio (SINR) is greater than the pre-determined threshold value. Hence, the data reliability of the cell-edge user is increased by eliminating the effect of the error propagation. We derive closed-form end-to-end exact bit error probability (BEP) of proposed system for various modulation constellations. Then, the optimum threshold value is analyzed in order to minimize BEP. The obtained expressions are validated via simulations and it is revealed that TBS-C-NOMA outperforms C-NOMA and full diversity order is achieved.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted