No abstract
In this paper, an improved LT code with a reverse coding framework is designed to reduce the error floor caused by low-degree information nodes. For the proposed coding scheme, a well-designed threshold is used to mark the information nodes whose degrees are less than the threshold, and these nodes will be coded reversely to connect to enough candidate check nodes. To design the optimal threshold, firstly, the information degree distribution and the check degree distribution of the improved LT code are deduced. Then, the parameter extrinsic information gain-loss-ratio (GLR) is designed to evaluate the convergence behavior of the improved LT code. Finally, the 'slow increase region' of the GLR is set, and the boundary value of this region is used to deduce the optimal threshold which matches with the channel state information (CSI) and decoding overhead. To make the proposed LT code not limited to a fixed code rate, we further modify the proposed scheme. The segment coding method is used to generate a redundant generator matrix, and the check nodes corresponding to this matrix can be transmitted independently and are not limited to a fixed number. Furthermore, the connection relationship between information nodes and check nodes can be easily recorded, which improves the decoding efficiency. The advantages of the improved LT code are that the degree distributions can be formulated, the convergence behavior can be predicted, and the lowest information degree can be adjusted. Simulation results show that the improved LT code can reduce the error floor by up to 4 orders of magnitude. Besides, the designed LT code outperforms the existing LT codes in literature in terms of bit error rate (BER) performance.INDEX TERMS Luby transform codes, threshold, degree distribution, convergence.
As a code-domain non-orthogonal multiple access technique, sparse code multiple access (SCMA) is considered as a promising technique for future wireless Internet of Things (IoT) networks. The minimum Euclidean distance (MED) and minimum product distance (MPD) have been highlighted as the key performance indicators of the codebook in additive gaussian white noise (AWGN) and downlink Rayleigh channels respectively. In this paper, based on the mother codebook, a novel codebook design scheme is proposed to achieve better error performance in both AWGN and downlink Rayleigh channels. The problem of constructing the mother codebook is considered as the quadratic assignment problem (QAP), where the Tabu searching algorithm is employed to reduce the complexity of searching for the best permutation result. Then, the rotation matrix is adopted to find the best degrees for the generation of the constellation group, and two algorithms are proposed to assign the obtained constellation in factor graph matrix. Taking the degree optimization and the constellation assignments into joint consideration, an improved unified optimization is further explored to maximize the MED of each user. Besides, a novel polarized modulation scheme is proposed, which places the symbols in the three dimensional (3D) stokes parameters to improve the performance of the system. Finally, simulation results are provided to show the performance of the proposed codebooks, and the comparisons of symbol error performance (SER) in different codebooks are also discussed in detail.INDEX TERMS Sparse code multiple access (SCMA), codebook design, minimum Euclidean distance, minimum product distance, three dimensional SCMA codebooks
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.