Abstract-Space shift keying (SSK) modulation and its extension, the generalized SSK (GSSK), present an attractive framework for the emerging large-scale MIMO systems in reducing hardware costs. In SSK, the maximum likelihood (ML) detector incurs considerable computational complexities. We propose a compressed sensing based detector, NCS, by formulating the SSK-type detection criterion as a convex optimization problem. The proposed NCS requires only O(ntNrNt) complexity, outperforming the O(NrN nt t ) complexity in the ML detector, at the cost of slight fidelity degradation. Simulations are conducted to substantiate the analytical derivation and the detection accuracy.
Abstract-In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed polynomial basis allows that h-point polynomial evaluation can be computed in O(h log 2 (h)) finite field operations with small leading constant. As compared with the canonical polynomial basis, the proposed basis improves the arithmetic complexity of addition, multiplication, and the determination of polynomial degree from O(h log 2 (h) log 2 log 2 (h)) to O(h log 2 (h)). Based on this basis, we then develop the encoding and erasure decoding algorithms for the (n = 2 r , k) Reed-Solomon codes. Thanks to the efficiency of transform based on the polynomial basis, the encoding can be completed in O(n log 2 (k)) finite field operations, and the erasure decoding in O(n log 2 (n)) finite field operations. To the best of our knowledge, this is the first approach supporting Reed-Solomon erasure codes over characteristic-2 finite fields while achieving a complexity of O(n log 2 (n)), in both additive and multiplicative complexities. As the complexity leading factor is small, the algorithms are advantageous in practical applications.
Abstract-Coexistence of multiple radio access technologies (RATs) is a promising paradigm to improve spectral efficiency. This letter presents a game-theoretic network selection scheme in a cognitive heterogeneous networking environment with timevarying channel availability. We formulate the network selection problem as a noncooperative game with secondary users (SUs) as the players, and show that the game is an ordinal potential game (OPG). A decentralized, stochastic learning-based algorithm is proposed where each SU's strategy progressively evolves toward the Nash equilibrium (NE) based on its own actionreward history, without the need to know actions in other SUs. The convergence properties of the proposed algorithm toward an NE point are theoretically and numerically verified. The proposed algorithm demonstrates good throughput and fairness performances in various network scenarios.
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.