Entity

Time filter

Source Type

Mecca, Saudi Arabia

Hanif M.,University of Victoria | Yang H.-C.,University of Victoria | Yang H.-C.,Strategic Research Initiative SRI | Alouini M.-S.,King Abdullah University of Science and Technology | Alouini M.-S.,Strategic Research Initiative SRI
IEEE Communications Letters | Year: 2014

Exact ergodic capacity calculation for fading wireless channels typically involves time-consuming numerical evaluation of infinite integrals. In this paper, lower and upper bounds on ergodic capacity for kth best path are presented. These bounds have simple analytic expressions which allow their fast evaluation. Numerical results show that the newly proposed bounds closely approximate the exact ergodic capacity for a large variety of system configurations. © 1997-2012 IEEE. Source


Abuzaid A.,King Abdullah University of Science and Technology | Ahmed Q.Z.,King Abdullah University of Science and Technology | Ahmed Q.Z.,Strategic Research Initiative SRI | Alouini M.-S.,King Abdullah University of Science and Technology | Alouini M.-S.,Strategic Research Initiative SRI
IEEE Signal Processing Letters | Year: 2014

In this letter, a joint detector for cooperative communication networks is proposed when the destination has limited hardware processing capability. The transmitter sends its symbols with the help of L relays. As the destination has limited hardware, only U out of L signals are processed and the energy of the remaining relays is lost. To solve this problem, a joint preprocessing based detector is proposed. This joint preprocessor based detector operate on the principles of minimizing the symbol error rate (SER). For a realistic assessment, pilot symbol aided channel estimation is incorporated for this proposed detector. From our simulations, it can be observed that our proposed detector achieves the same SER performance as that of the maximum likelihood (ML) detector with all participating relays. Additionally, our detector outperforms selection combining (SC), channel shortening (CS) scheme and reduced-rank techniques when using the same U. Our proposed scheme has low computational complexity. © 2014 IEEE. Source

Discover hidden collaborations