| 1. |
|
|
| 2. |
- Makki, Behrooz, 1980, et al.
(author)
-
Feedback Subsampling in Temporally-Correlated Slowly-Fading Channels using Quantized CSI
- 2013
-
In: IEEE Transactions on Communications. - 0090-6778 .- 1558-0857. ; 61:6, s. 2282-2294
-
Journal article (peer-reviewed)abstract
- This paper studies the problem of feedback subsampling in temporally-correlated wireless networks utilizing quantized channel state information (CSI). Under both peak and average power constraints, the system data transmission efficiency is studied in two scenarios. First, we focus on the case where the codewords span one fading block. In the second scenario, the throughput is determined for piecewise slowly-fading channels where the codewords are so long that a finite number of correlated gain realizations are experienced during each codeword transmission. Considering different temporal correlation conditions in both scenarios, substantial throughput increment is observed with feedback rates well below 1 bit per slot.
|
|
| 3. |
- Makki, Behrooz, 1980, et al.
(author)
-
On ARQ-Based Fast-Fading Channels
- 2012
-
In: IEEE Communications Letters. - 1558-2558 .- 1089-7798. ; 16:12, s. 1921-1924
-
Journal article (peer-reviewed)abstract
- Automatic repeat request (ARQ) protocols are normally studied under slow-fading or quasi-static channel assumption where the fading coefficients are assumed to remain fixed during the transmission of a codeword or for the duration of all ARQ retransmission rounds, respectively. This letter investigates the performance of basic ARQ and incremental redundancy hybrid ARQ protocols in fast-fading channels where a number of channel realizations are experienced in each retransmission round. Long-term throughput, delay-limited throughput and outage probability of the ARQ schemes are obtained. Compared to slow-fading and quasi-static channels, a fast-fading channel results in a higher performance for both basic and incremental redundancy ARQ. The fast-fading channel, however, can be mapped to an equivalent slow-fading model at low signal-to-noise ratios. Finally, we show that the efficiency of ARQ protocols is overestimated if the fast-fading variations during a codeword transmission are approximated by their average value.
|
|
| 4. |
|
|
