On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel

03/22/2018
by   Luiza Medova, et al.
0

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four parts: (i) the data transmission is partitioned into time slots; (ii) the data, transmitted in each slot, is split into two parts, the first one set an interleaver of the low-density parity-check (LDPC) type code and is encoded by spreading sequence or codewords that are designed to be decoded by compressed sensing type decoding; (iii) the another part of transmitted data is encoded by LDPC type code and decoded using a joint message passing decoding algorithm designed for the T-user binary input Gaussian MAC; (iv) users repeat their codeword in multiple slots. In this paper we are concentrated on the third part of considered scheme. We generalized the PEXIT charts to optimize the protograph of LDPC code for Gaussian MAC. The simulation results, obtained at the end of the paper, were analyzed and compared with obtained theoretical bounds and thresholds. Obtained simulation results shows that proposed LDPC code constructions have better performance under joint decoding algorithm over Gaussian MAC than LDPC codes considered by A. Vem et al in 2017, that leads to the better performance of overall transmission system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2020

SPARC-LDPC Coding for MIMO Massive Unsourced Random Access

A joint sparse-regression-code (SPARC) and low-density-parity-check (LDP...
research
06/12/2019

A Joint Graph Based Coding Scheme for the Unsourced Random Access Gaussian Channel

This article introduces a novel communication paradigm for the unsourced...
research
07/01/2022

Grant-Free Transmission by LDPC Matrix Mapping and Integrated Cover-MPA Detector

In this paper, a novel transceiver architecture is proposed to simultane...
research
02/21/2022

Efficient Massive Machine Type Communication (mMTC) via AMP

We propose efficient and low complexity multiuser detection (MUD) algori...
research
05/26/2021

Random Access Based on Maximum Average Distance Code for Massive MTC in Cellular IoT Networks

Code-expanded Random Access (CeRA) is a promising technique for supporti...
research
02/23/2023

Irregular Repetition Slotted ALOHA Over the Binary Adder Channel

We propose an irregular repetition slotted ALOHA (IRSA) based random-acc...
research
07/26/2022

Data-aided Active User Detection with False Alarm Correction in Grant-Free Transmission

In most existing grant-free (GF) studies, the two key tasks, namely acti...

Please sign up or login with your details

Forgot password? Click here to reset