Mostra el registre d'ítem simple
A rate-splitting approach to fading channels with imperfect channel-state information
dc.contributor.author | Pastore, Adriano |
dc.contributor.author | Koch, Tobias |
dc.contributor.author | Rodríguez Fonollosa, Javier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions |
dc.date.accessioned | 2014-07-31T09:02:21Z |
dc.date.created | 2014-07 |
dc.date.issued | 2014-07 |
dc.identifier.citation | Pastore, A.; Koch, T.; R. Fonollosa, Javier. A rate-splitting approach to fading channels with imperfect channel-state information. "IEEE transactions on information theory", Juliol 2014, vol. 60, núm. 7, p. 4266-4285. |
dc.identifier.issn | 0018-9448 |
dc.identifier.uri | http://hdl.handle.net/2117/23656 |
dc.description.abstract | As shown by Médard, the capacity of fading channels with imperfect channel-state information can be lower-bounded by assuming a Gaussian channel input X with power P and by upper-bounding the conditional entropy h(X|Y,H) by the entropy of a Gaussian random variable with variance equal to the linear minimum mean-square error in estimating X from \(Y, H). We demonstrate that, using a rate-splitting approach, this lower bound can be sharpened: by expressing the Gaussian input X as the sum of two independent Gaussian variables X1 and X2 and by applying Médard's lower bound first to bound the mutual information between X1 and Y while treating X2 as noise, and by applying it a second time to the mutual information between X2 and Y while assuming X1 to be known, we obtain a capacity lower bound that is strictly larger than Médard's lower bound. We then generalize this approach to an arbitrary number L of layers, where X is expressed as the sum of L independent Gaussian random variables of respective variances Pl, l = 1, ¿ ,L summing up to P. Among all such rate-splitting bounds, we determine the supremum over power allocations Pl and total number of layers L. This supremum is achieved for L 8 and gives rise to an analytically expressible capacity lower bound. For Gaussian fading, this novel bound is shown to converge to the Gaussian-input mutual information as the signal-to-noise ratio (SNR) grows, provided that the variance of the channel estimation error H-H tends to zero as the SNR tends to infinity. |
dc.format.extent | 20 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
dc.subject.lcsh | Gaussian processes |
dc.subject.lcsh | Entropy (Information theory) |
dc.subject.other | Channel capacity |
dc.subject.other | Fading channels |
dc.subject.other | Flat fading |
dc.subject.other | Imperfect channel-state information |
dc.title | A rate-splitting approach to fading channels with imperfect channel-state information |
dc.type | Article |
dc.subject.lemac | Processos gaussians |
dc.subject.lemac | Entropia (Teoria de la informació) |
dc.contributor.group | Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions |
dc.identifier.doi | 10.1109/TIT.2014.2321567 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6832779 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 15045379 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Pastore, A.; Koch, T.; R. Fonollosa, Javier |
local.citation.publicationName | IEEE transactions on information theory |
local.citation.volume | 60 |
local.citation.number | 7 |
local.citation.startingPage | 4266 |
local.citation.endingPage | 4285 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [178]
-
Articles de revista [2.526]