Dio Resya Baaqii
Unknown Affiliation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Menentukan Degree Distribution Optimal Pada Coded Random Access (CRA) Dengan Multi User Detection (MUD) K = 3 Menggunakan Extrinsic Information Transfer (EXIT) Chart Dio Resya Baaqii; Yusnita Rahayu; Khoirul Anwar
Jurnal Online Mahasiswa (JOM) Bidang Teknik dan Sains Vol 6 (2019): Edisi 1 Januari s/d Juni 2019
Publisher : Jurnal Online Mahasiswa (JOM) Bidang Teknik dan Sains

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This paper proposes an optimal degree distribution for Coded Random Access (CRA) exploiting Multi User Detection (MUD) with capability of K = 3. The CRA with MUD K = 3 can support the fifth telecommunication generation (5G) networks and massive machine-type communications, including the Internet-of-Things (IoT). The optimization is performed by the help of Extrinsic Information Transfer (EXIT) chart, a visual tool describing the behavior of the wireless networks, and a series of computer to validate the expected results. We found that the IoT networks using the proposed optimal degree distribution, having only two terms with less exponent, can achieve the maximum offered traffic (G∗) of 2.736 packet/slot.Keyword: Degree distribution, multi user detection, coded random access.