The transmission of a Gaussian source over a blockfading multiple antenna channel in the presence of a feedback link is considered. The feedback link is assumed to be an error and delay free link of capacity 1 bit per channel use. Under the short-term power constraint, the optimal exponential behavior of the end-to-end average distortion is characterized for all source-channel bandwidth ratios. It is shown that the optimal transmission strategy is successive refinement source coding followed by progressive transmission over the channel, in which the channel block is allocated dynamically among the layers based on the channel state using the feedback link as an instantaneous automatic repeat request (ARQ) signal. © 2009 IEEE.
Distortion exponent in MIMO channels with feedback / Gunduz, D.; Goldsmith, A. J.; Poor, H. V.. - (2009), pp. 293-297. (Intervento presentato al convegno 2009 IEEE Information Theory Workshop, ITW 2009 tenutosi a Taormina, Sicily, ita nel 2009) [10.1109/ITW.2009.5351220].
Distortion exponent in MIMO channels with feedback
D. Gunduz;
2009
Abstract
The transmission of a Gaussian source over a blockfading multiple antenna channel in the presence of a feedback link is considered. The feedback link is assumed to be an error and delay free link of capacity 1 bit per channel use. Under the short-term power constraint, the optimal exponential behavior of the end-to-end average distortion is characterized for all source-channel bandwidth ratios. It is shown that the optimal transmission strategy is successive refinement source coding followed by progressive transmission over the channel, in which the channel block is allocated dynamically among the layers based on the channel state using the feedback link as an instantaneous automatic repeat request (ARQ) signal. © 2009 IEEE.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
