LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Wasserstein GAN Autoencoder for SCMA Networks

Photo by sotti from unsplash

In the view of the exponential growth of mobile applications, the Sparse Code Multiple Access (SCMA) is one promising code-domain Non-Orthogonal Multiple Access (NOMA) technique. The challenge in the adoption… Click to show full abstract

In the view of the exponential growth of mobile applications, the Sparse Code Multiple Access (SCMA) is one promising code-domain Non-Orthogonal Multiple Access (NOMA) technique. The challenge in the adoption of SCMA in practical networks is twofold: designing optimal codebooks at the transmitter and decoding the data at the receiver. However, most of the works available in the literature address only one aspect. In this letter, we design an end-to-end SCMA en/deconding structure based on the integration between a state-of-the-art autoencoder architecture and a novel Wasserstein Generative Adversarial Network (WGAN) that improves the robustness to the channel noise. We compare the performance obtained by the proposed network with conventional computationally intensive solutions and a deep learning based autoencoder. The performance achieved show better performances in terms of Symbol Error Rate (SER), especially at low energy per bit to noise power spectral density ratio.

Keywords: scma; autoencoder; wasserstein gan; gan autoencoder; scma networks; autoencoder scma

Journal Title: IEEE Wireless Communications Letters
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.