Browsing by Subject "Gaussian mixture"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    LDPC code design for the two-user Gaussian multiple access channel
    (Institute of Electrical and Electronics Engineers Inc., 2016) Sharifi S.; Tanc, A. K.; Duman, T. M.
    We study code design for two-user Gaussian multiple access channels (GMACs) under fixed channel gains and under quasi-static fading. We employ low-density parity-check (LDPC) codes with BPSK modulation and utilize an iterative joint decoder. Adopting a belief propagation (BP) algorithm, we derive the PDF of the log-likelihood-ratios (LLRs) fed to the component LDPC decoders. Via examples, it is illustrated that the characterized PDF resembles a Gaussian mixture (GM) distribution, which is exploited in predicting the decoding performance of LDPC codes over GMACs. Based on the GM assumption, we propose variants of existing analysis methods, named modified density evolution (DE) and modified extrinsic information transfer (EXIT). We derive a stability condition on the degree distributions of the LDPC code ensembles and utilize it in the code optimization. Under fixed channel gains, the newly optimized codes are shown to perform close to the capacity region boundary outperforming the existing designs and the off-the-shelf point-to-point (P2P) codes. Under quasi-static fading, optimized codes exhibit consistent improvements upon the P2P codes as well. Finite block length simulations of specific codes picked from the designed ensembles are also carried out and it is shown that optimized codes perform close to the outage limits. © 2015 IEEE.
  • Thumbnail Image
    ItemOpen Access
    Spectrum sensing via restricted neyman-pearson approach in the presence of non-Gaussian noise
    (IEEE, 2013) Turgut, Esma; Gezici, Sinan
    In this paper, spectrum sensing in cognitive radio systems is studied for non-Gaussian channels in the presence of prior distribution uncertainty. In most practical cases, some amount of prior information about signals of primary users is available to secondary users but that information is never perfect. In order to design optimal spectrum sensing algorithms in such cases, we propose to employ the restricted Neyman-Pearson (NP) approach, which maximizes the average detection probability under constraints on the worst-case detection and false-alarm probabilities. We derive a restricted NP based spectrum sensing algorithm for additive Gaussian mixture noise channels, and compare its performance against the generalized likelihood ratio test (GLRT) and the energy detector. Simulation results show that the proposed spectrum sensing algorithm provides improvements over the other approaches in terms of minimum (worst-case) and/or average detection probabilities. © 2013 IEEE.