Nosratinia, Aria

Permanent URI for this collection

Aria Nosratiniais Erik Jonsson Distinguished Professor and associate head of the electrical engineering department. He is also the director of the Multimedia Communications Laboratory and is a Fellow of IEEE. Dr. Nosratinia is an authority on communication and information theory, particularly in cooperative wireless communication and spectrum sharing, also sometimes known as cognitive radio. His recent research interests include:

  • LDPC codes
  • Linear receivers
  • Cognitive networks
  • Coherence disparity and broadcast channels
  • Lattice coding

ORCID page


Recent Submissions

Now showing 1 - 7 of 7
  • Item
    Exact Recovery in Community Detection with Continuous-Valued Side Information
    (IEEE-inst Electrical Electronics Engineers Inc, 2019-02) Saad, Hussein; Nosratinia, Aria; 0000-0002-3751-0165 (Nosratinia, A); 0000-0002-9706-6721 (Saad, H); Saad, Hussein; Nosratinia, Aria
    The community detection problem, as a special case of inference on graphs, has received much attention lately. However, in the presence of continuous-valued side information, the behavior of a sharp threshold for exact recovery has remained open, and is addressed in this letter. The new proof presented herein has the further advantage of closing the gap between necessary and sufficient conditions for exact recovery threshold that has existed in community detection under finite-alphabet side information.
  • Item
    Spatially Correlated MIMO Broadcast Channel with Partially Overlapping Correlation Eigenspaces
    (Institute of Electrical and Electronics Engineers Inc.) Zhang, Fan; Nosratinia, Aria; 0000-0003-4623-4200 (Zhang, F); 0000-0002-3751-0165 (Nosratinia, A); 105575689 (Nosratinia, A); Zhang, Fan; Nosratinia, Aria
    The spatially correlated MIMO broadcast channel has grown in importance due to emerging interest in massive MIMO and mm-wave communication, but much about this channel remains unknown. In this paper, we study a two-user MIMO broadcast channel where the spatial correlation matrices corresponding to the two receivers have eigenspaces that are neither identical nor disjoint, but are partially overlapped. Spatially correlated channels occur in e.g. massive MIMO and furthermore different links may credibly have correlation eigenspaces that are neither disjoint nor equal, therefore this problem is practically motivated. This paper develops a new approach for this scenario and calculates the corresponding degrees of freedom. Our technique involves a careful decomposition of the signaling space to allow a combination of pre-beamforming along directions that depend on the relative positioning of the non-overlapping and overlapping components of the eigenspaces, along with the product superposition technique. The ideas are demonstrated with a toy example, are developed in two conditions of varying complexity, and are illuminated by numerical results. ©2018 IEEE.
  • Item
    Side Information in Recovering a Single Community: Information Theoretic Limits
    (Institute of Electrical and Electronics Engineers Inc.) Saad, Hussein; Nosratinia, Aria; Saad, Hussein; Nosratinia, Aria
    In this paper, we study the effect of side information on the information limits of recovering a hidden community of size K inside a graph consisting of n nodes with K = o(n). Side information for each node in the graph is modeled by a random vector whose components have finite cardinality. The variation in quantity of side information as a function of graph size n is represented by varying the size of the vector of side information while keeping the log-likelihood ratio (LLR) of each component with respect to the node labels fixed. We show when and by how much side information can improve the information limits of weak and exact recovery by providing tight necessary and sufficient conditions for both weak and exact recovery. Furthermore, we show that, under certain conditions, any algorithm achieving weak recovery can also achieve exact recovery if followed by a local voting procedure. © 2018 IEEE.
  • Item
    Multiple-Access Channel Resolvability with Cribbing
    (Institute of Electrical and Electronics Engineers Inc.) Helal, Noha; Bloch, M.; Nosratinia, Aria; 0000-0002-3751-0165 (Nosratinia, A); 105575689 (Nosratinia, A); Helal, Noha; Nosratinia, Aria
    We study channel resolvability for the discrete memoryless multiple access channel with cribbing, i.e., the characterization of the amount of randomness required to approximate an i.i.d. output distribution in terms of Kullback-Leibler divergence. We analyze the cases in which one encoder cribs (i) the input of the other encoder; or the output of the other encoder (ii) noncausally, (iii) causally, or (iv) strictly-causally. For cases (i)-(iii), we exactly characterize the channel resolvability region. For case (iv), we provide inner and outer bounds for the channel resolvability region; our achievability result handles the strict causality constraint with a block-Markov coding scheme in which dependencies across blocks are suitably hidden.
  • Item
    On the Separability of Ergodic Fading MIMO Channels: A Lattice Coding Approach
    (Institute of Electrical and Electronics Engineers Inc.) Hindy, Ahmed; Nosratinia, Aria; 0000-0002-3751-0165 (Nosratinia, A); 105575689 (Nosratinia, A); Hindy, Ahmed; Nosratinia, Aria
    This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use separable coding, i.e., coding independently and in parallel over different fading states. Unfortunately, separable coding has drawbacks including large memory requirements at both communication ends. In this paper a lattice coding and decoding scheme is proposed that achieves the ergodic capacity without separable coding, with lattice codebooks and decoding decision regions that are universal across channel realizations. We first demonstrate this result for fading distributions with discrete, finite support whose sequences are robustly typical. Results are then extended to continuous fading distributions, as well as multiple-input multiple-output (MIMO) systems. In addition, a variant of the proposed scheme is presented for the MIMO ergodic fading channel with CSIR only, where we prove the existence of a universal codebook that achieves rates within a constant gap to capacity for finite-support fading distributions. The gap is small compared with other schemes in the literature. Extension to continuous-valued fading is also provided.
  • Item
    Belief Propagation with Side Information for Recovering a Single Community
    (Institute of Electrical and Electronics Engineers Inc.) Saad, Hussein; Nosratinia, Aria; 0000-0002-3751-0165 (Nosratinia, A); 105575689 (Nosratinia, A); Saad, Hussein; Nosratinia, Aria
    In this paper, we study the effect of side information on the recovery of a hidden community of size K inside a graph consisting of n nodes with K=o(n). We focus on side information with finite cardinality and bounded (as nrightarrow propto) log-likelihood ratios (LLRs). We calculate tight necessary and sufficient conditions for weak recovery of the labels subject to observation of the graph and side information under belief propagation (BP). Also, we show that BP with side information is strictly inferior to the maximum likelihood detector without side information. Finally, we validate our results through simulations on finite synthetic data-sets that shows the power of our asymptotic results in characterizing the performance even at finite n.
  • Item
    Multilevel Coding for the Full-Duplex Decode-Compress-Forward Relay Channel
    (MDPI AG, 2018-10-22) Abotabl, Ahmed Attia; Nosratinia, Aria; 0000-0002-3751-0165 (Nosratinia, A); 105575689 (Nosratinia, A); Abotabl, Ahmed Attia; Nosratinia, Aria
    The Decode-Compress-Forward (DCF) is a generalization of Decode-Forward (DF) and Compress-Forward (CF). This paper investigates conditions under which DCF offers gains over DF and CF, addresses the problem of coded modulation for DCF, and evaluates the performance of DCF coded modulation implemented via low-density parity-check (LDPC) codes and polar codes. We begin by revisiting the achievable rate of DCF in discrete memoryless channels under backward decoding. We then study coded modulation for the decode-compress-forward via multi-level coding. We show that the proposed multilevel coding approaches the known achievable rates of DCF. The proposed multilevel coding is implemented (and its performance verified) via a combination of standard DVB-S2 LDPC codes, and polar codes whose design follows the method of Blasco-Serrano.

Works in Treasures @ UT Dallas are made available exclusively for educational purposes such as research or instruction. Literary rights, including copyright for published works held by the creator(s) or their heirs, or other third parties may apply. All rights are reserved unless otherwise indicated by the copyright owner(s).