Peyman Razaghi

Peyman Razaghi

Auto-generated profile, based on publicly available information

Peyman Razaghi

Department of Electrical and Computer Engineering University of Southern California Los Angeles California USA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2011 in arXiv
Verified
Preprint
Open access
PDF file
PRPeyman Razaghi
Peyman Razaghi
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
Cadambe and Jafar (CJ) alignment strategy for the K-user scalar frequency-selective fading Gaussian channel, with encoding over blocks of 2n+1 random channel coefficients (subcarriers) is considered. The linear zero-forcing (LZF) strategy is compared with a novel approach based on lattice alignment and lattice decoding (LD). Despite both LZF and LD achieve the same degrees of freedom, it is shown that LD can achieve very significant improvements in terms of error rates at practical SNRs with respect to the conventional LZF proposed in the literature. We also show that these gains are realized provided that channel gains are controlled to be near constant, for example, by means of power control and opportunistic carrier and user selection strategies. In presence of relatively-small variations in the normalized channel coefficient amplitudes, CJ alignment strategy yields very disappointing results at finite SNRs, and the gain of LD over ZLF significantly reduces. In light of these results, the practical applicability of CJ alignment scheme remains questionable, in particular for Rayleigh fading channels, where channel inversion power control yields to unbounded average transmit power.

15 November 2012 in arXiv
Verified
Preprint
Open access
PDF file
PRPeyman Razaghi
Peyman Razaghi
SZSong Nam Hong. Lei Zhou
Song Nam Hong. Lei Zhou
WYWei Yu
Wei Yu
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed limited rate $R_0$ bits per channel use. The out-of-band nature of the relay is reflected by the fact that the common relay message does not interfere with the received signal at the two destinations. A general achievable rate is established, along with upper bounds on the capacity region for the Gaussian case. For $R_0$ values below a certain threshold, which depends on channel parameters, the capacity region of this channel is determined in this paper to within a constant gap of $\Delta=1.95$ bits. We identify interference regimes where a two-for-one gain in achievable rates is possible for every bit relayed, up to a constant approximation error. Instrumental to these results is a carefully-designed quantize-and-forward type of relay strategy along with a joint decoding scheme employed at destination ends. Further, we also study successive decoding strategies with optimal decoding order (corresponding to the order at which common, private, and relay messages are decoded), and show that successive decoding also achieves two-for-one gains asymptotically in regimes where a two-for-one gain is achievable by joint decoding; yet, successive decoding produces unbounded loss asymptotically when compared to joint decoding, in general.

11 October 2010 in arXiv
Verified
Preprint
Open access
PDF file
PRPeyman Razaghi
Peyman Razaghi
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
We consider a two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with a common multiple-antenna relay, and a shared digital (noiseless) link between the relay and the two destinations. For this channel, this paper introduces an asymptotically sum-capacity-achieving quantize-and-forward (QF) relay strategy. Our technique to design an asymptotically optimal relay quantizer is based on identifying a cross-deterministic relation between the relay observation, the source signal, and the destination observation. In a relay channel, an approximate cross deterministic relation corresponds to an approximately deterministic relation, where the relay observation is to some extent a deterministic function of the source and destination signals. We show that cross determinism can serve as a measure for quantization penalty. By identifying an analogy between a deterministic broadcast relay channel and a Gaussian MIMO relay channel, we propose a three-stage dirty paper coding strategy, along with receiver beamforming and quantization at the relay, to asymptotically achieve an extended achievable rate region for the MIMO broadcast channel with a common multiple-antenna relay.