Main Article Content
Sparse Code Multiple Access (SCMA) is a powerful multiple access technique for future generations of wireless communication where users are allowed to transmit through pre-defined channel resources with a controlled degree of collision. The base-station then recovers all the users' data through some iterative method. The well-known Message-Passing Algorithm (MPA) has excellent performance but has exponential decoding complexity. Alternative decoding algorithms, such as MPA in the log-domain (Log-MPA), have been proposed in the literature aiming to reduce the decoding complexity while not significantly decreasing performance. In recent work, the authors proposed a modification in the conventional Log-MPA by exploring a tree structure associated with the decoding equations. By properly avoiding symbols with low reliability, a pruned tree is obtained, yielding an arbitrary trade-off between performance and complexity in the joint detection. In the present work, we extend this contribution by showing that the advantages of the tree-based decoding algorithm are magnified when SCMA is coupled to an error-correcting code, in particular, a Low-Density-Parity-Check (LDPC) code. Through computer simulations, we show that an improved performance-decoding complexity trade-off is obtained.
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).