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
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).
(IEEE-inst Electrical Electronics Engineers Inc, 2019-02)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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
(MDPI AG, 2018-10-22)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 ...