A Flexible Encoding Decoding Procedure for 6G SCMA Wireless Networks via Adversarial

5G networks may not be competent in fully supporting the high data rates, system capacity, and spectral efficiency expected in the upcoming 6G networks. An enabling factor to achieve these requirements is the adoption of the Sparse Code Multiple Access (SCMA), which is one of the most promising code-domain Non-Orthogonal Multiple Access (NOMA) techniques. Nowadays, there are two major challenges for the implementation of SCMA in practical networks. First, the design of a near-optimal codebook set at the transmitter, which heavily impacts the network performance. Second, an efficient decoding algorithm at the receiver, which dominates the computational complexity of the system. The two aspects are not independent from each other; therefore the optimization of an SCMA network should address jointly both the Encoder and the Decoder side. However, most of the works available in the literature address only one aspect and also are not tailored for a given radio channel. In this paper, we design an end-to-end SCMA en/deconding structure based on the integration between a state-of-the-art AutoEncoder (AE) architecture and a novel Wasserstein Generative Adversarial Network (WGAN). The aim is to jointly create a near-optimal codebook design and a non-computationally heavy Decoder that are robust to the given channel statistics. Finally, we trained our model to be flexible to support different channel conditions and compared its performance against the state-of-the-art AE and the best conventional Decoders. The simulation results show that our innovative design exhibits decoding performance very similar to conventional Decoders with a reduced decoding latency.