### Skapa referens, olika format (klipp och klistra)

**Harvard**

Aulin, J. och Jeremic, D. (2011) *Compressive Sensing for the Capacity of a Rayleigh Fading Channel *.

** BibTeX **

@conference{

Aulin2011,

author={Aulin, Jocelyn and Jeremic, Djordje},

title={Compressive Sensing for the Capacity of a Rayleigh Fading Channel },

booktitle={2011 IEEE International Conference on Communications, ICC 2011; Kyoto; Japan; 5 June 2011 through 9 June 2011},

isbn={978-1-61284-232-5 },

pages={Art. no. 5962506},

abstract={A given objective function, $I(p_X(x))$, is to be maximized over the argument $p_X(x)$, where $p_X(x)$ is a continuous function of $x in R^1$. Rather than optimizing $I(p_X(x))$ over the domain of functions, where the optimal solution $p_X^*(x)$ is non-zero only at a few but unknown discrete points $x in {x_1 , x_2 , ldots , x_S } $, is it possible to solve the optimization problem by optimizing the objective function over S discrete components only? This is the main problem addressed and is solved using compressive sensing (CS) with application to the determination of the capacity of a discrete memoryless Rayleigh-fading channel with peak and average input power constraints. A novel optimization algorithm is developed and applied to a known example. Simulation results, using this novel optimization algorithm, are generated which provides an accurate estimate of the optimizing distribution and the resultant capacity. The significance of this approach is that it can be applied to optimization problems in general and specifically, to communication systems where the domain can be compressed.},

year={2011},

keywords={Compressed sensing, Mutual information, Numerical models, Optimization, Rayleigh channels, Signal to noise ratio },

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 143869

A1 Aulin, Jocelyn

A1 Jeremic, Djordje

T1 Compressive Sensing for the Capacity of a Rayleigh Fading Channel

YR 2011

T2 2011 IEEE International Conference on Communications, ICC 2011; Kyoto; Japan; 5 June 2011 through 9 June 2011

SN 978-1-61284-232-5

AB A given objective function, $I(p_X(x))$, is to be maximized over the argument $p_X(x)$, where $p_X(x)$ is a continuous function of $x in R^1$. Rather than optimizing $I(p_X(x))$ over the domain of functions, where the optimal solution $p_X^*(x)$ is non-zero only at a few but unknown discrete points $x in {x_1 , x_2 , ldots , x_S } $, is it possible to solve the optimization problem by optimizing the objective function over S discrete components only? This is the main problem addressed and is solved using compressive sensing (CS) with application to the determination of the capacity of a discrete memoryless Rayleigh-fading channel with peak and average input power constraints. A novel optimization algorithm is developed and applied to a known example. Simulation results, using this novel optimization algorithm, are generated which provides an accurate estimate of the optimizing distribution and the resultant capacity. The significance of this approach is that it can be applied to optimization problems in general and specifically, to communication systems where the domain can be compressed.

LA eng

DO 10.1109/icc.2011.5962506

LK http://dx.doi.org/10.1109/icc.2011.5962506

OL 30