Tareq Y. Al-Naffouri

Tareq Y. Al-Naffouri

Auto-generated profile, based on publicly available information

Tareq Y. Al-Naffouri

Electrical Engineering Department, KFUPM, Dhahran, Saudi Arabia

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
18 February 2009 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
TAT. Al-Naffouri
T. Al-Naffouri
MSM. Sharif
M. Sharif
BHB. Hassibi
B. Hassibi
This paper considers the effect of spatial correlation between transmit antennas on the sum-rate capacity of the MIMO Gaussian broadcast channel (i.e., downlink of a cellular system). Specifically, for a system with a large number of users n, we analyze the scaling laws of the sum-rate for the dirty paper coding and for different types of beamforming transmission schemes. When the channel is i.i.d., it has been shown that for large n, the sum rate is equal to M log log n + M log P/M + o(1) where M is the number of transmit antennas, P is the average signal to noise ratio, and o(1) refers to terms that go to zero as n rarr infin. When the channel exhibits some spatial correlation with a covariance matrix R (non-singular with tr(R) = M), we prove that the sum rate of dirty paper coding is M log log n + M log P/M + log det(R) + o(1). We further show that the sum-rate of various beamforming schemes achieves M log log n + M log P/M + M log c + o(1) where c les 1 depends on the type of beamforming. We can in fact compute c for random beamforming proposed in and more generally, for random beamforming with preceding in which beams are pre-multiplied by a fixed matrix. Simulation results are presented at the end of the paper.

13 September 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
ADAla A. Dahman
Ala A. Dahman
MSMuhammad Saqib Sohail
Muhammad Saqib Sohail
WXWeiyu Xu
Weiyu Xu
BHBabak Hassibi
Babak Hassibi
This paper proposes a low-complexity algorithm for blind equalization of data in orthogonal frequency division multiplexing (OFDM)-based wireless systems with general constellations. The proposed algorithm is able to recover the transmitted data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information about the channel and thus does not suffer from latency normally associated with blind methods. The paper demonstrates how to reduce the complexity of the algorithm, which becomes especially low at high signal-to-noise ratio (SNR). Specifically, it is shown that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of the proposed algorithm.

22 December 2008 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
ADAmir F. Dana
Amir F. Dana
BHBabak Hassibi
Babak Hassibi
Broadcast (or point to multipoint) communication has attracted a lot of research recently. In this paper, we consider the group broadcast channel where the users' pool is divided into groups, each of which is interested in common information. Such a situation occurs for example in digital audio and video broadcast where the users are divided into various groups according to the shows they are interested in. The paper obtains upper and lower bounds for the sum rate capacity in the large number of users regime and quantifies the effect of spatial correlation on the system capacity. The paper also studies the scaling of the system capacity when the number of users and antennas grow simultaneously. It is shown that in order to achieve a constant rate per user, the number of transmit antennas should scale at least logarithmically in the number of users.

11 July 2012 in arXiv
Verified
Preprint
Open access
PDF file
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
ADAla Dahman
Ala Dahman
MSMuhammad S. Sohail
Muhammad S. Sohail
WXWeiyu Xu
Weiyu Xu
BHBabak Hassibi
Babak Hassibi
This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of our algorithm.

23 January 2011 in arXiv
Verified
Preprint
Open access
PDF file
EAEbrahim B. Al-Safadi
Ebrahim B. Al-Safadi
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
This work establishes the design, analysis, and fine-tuning of a Peak-to-Average-Power-Ratio (PAPR) reducing system, based on compressed sensing at the receiver of a peak-reducing sparse clipper applied to an OFDM signal at the transmitter. By exploiting the sparsity of the OFDM signal in the time domain relative to a pre-defined clipping threshold, the method depends on partially observing the frequency content of extremely simple sparse clippers to recover the locations, magnitudes, and phases of the clipped coefficients of the peak-reduced signal. We claim that in the absence of optimization algorithms at the transmitter that confine the frequency support of clippers to a predefined set of reserved-tones, no other tone-reservation method can reliably recover the original OFDM signal with such low complexity. Afterwards we focus on designing different clipping signals that can embed a priori information regarding the support and phase of the peak-reducing signal to the receiver, followed by modified compressive sensing techniques for enhanced recovery. This includes data-based weighted {\ell} 1 minimization for enhanced support recovery and phase-augmention for homogeneous clippers followed by Bayesian techniques. We show that using such techniques for a typical OFDM signal of 256 subcarriers and 20% reserved tones, the PAPR can be reduced by approximately 4.5 dB with a significant increase in capacity compared to a system which uses all its tones for data transmission and clips to such levels. The design is hence appealing from both capacity and PAPR reduction aspects.