Title: Methods for Compression of Feedback in Adaptive Multi-carrier 4G Schemes
1Methods for Compression of Feedback in Adaptive
Multi-carrier 4G Schemes
- Víctor P. Gil Jiménez
- Ana García Armada
- M. Julia Fernández-Getino García
- University Calos III de Madrid
- Spain
2Outline
- OFDMA for Downlink in 4G.
- Feedback information.
- Opportunistic Feedback.
- System Description.
- Algorithms for compression
- Time correlation
- Frequency correlation
- Time-Frequency correlation
- Results.
- Conclusions.
3OFDMA for downlink in 4G
- Several techniques for Downlink.
- OFDMA (Orthogonal Frequency Division Multiple
Access) is one of the candidates. - The BS (Base Station) allocates the different
users transmission across the orthogonal
frequencies.
4Feedback Information
- The Adaptive Modulation selects the adequate
Modulation and Coding Scheme (MCS) according to
instantaneous channel conditions for each
terminal. - Channel is usually known (estimated/predicted) at
the receiver. - The receiver should feedback this information.
- It may be highly rate-demanding.
Reduction Compression
5Opportunistic Feedback
- The scheduler usually selects the best user(s)
for transmitting. Maximum Throughput criterion. - It is a waste of resources if a terminal with a
bad channel feeds back its data (it will never be
served except for fairness policies). - The BS broadcasts a minimum quality for feeding
back.
6Opportunistic FeedbackSome Results
Prob of finding a sub-carrier able to tx gt 4 bits
(Load factor subcarr occupied when user
arrives)
UMTS Vehicular A Channel
7Opportunistic FeedbackSome Results
Load Factor 0
8System Description
9System DescriptionParameters
- Downlink OFDMA.
- 512 sub-carriers (416 useful for data).
- Sub-carriers divided into groups of 8
sub-carriers during 12 OFDM symbols a chunk. - 52 chunks in total.
- The same MCS in the same chunk but different
(possibly) among them. Adaptive Modulation at
chunk level. - Available modulations BPSK 256 QAM.
- UMTS channel models vehicular A, pedestrian A.
10System DescriptionA Chunk
11Algorithms for compression
- Huffman coding for compression. Needs well
conditioned data. - Using Time correlation.
- Using Frequency correlation.
- Using Time-Frequency correlation.
(BPSK, QPSK, 64QAM)
12Algorithms for CompressionTime and Frequency
Correlation
Feed-back difference between actual and former
chunk
Time
Frequency
13Algorithms for CompressionIterative Time -
Frequency
Design a Huffman code for each combination bit-1,
bi-1t 64 codes
14Algorithms for CompressionBlock Time - Frequency
Time
Design a Huffman code for each combination
bi-1t-1, bit-1 , bi1t-1 512 codes
15ResultsComparison to other algorithms
- 30 users. UMTS Vehicular A channel. 50 km/h and
SNR 20 dB
16ResultsUMTS Vehicular A Channel
17ResultsUMTS Pedestrian A Channel
18ResultsRobustness
- 100 km/h. AWGN Feedback Channel. Different
Refresh Rate
19Conclusions
- Opportunistic feedback allows 50 of reduction
in feedback data. - The compression of feedback data by using time,
frequency or both correlation is feasible and
offers compression in the range of 50 more. - Time-Frequency techniques exhibit better
performance than the others (in general). - Compression algorithms jointly with Opportunistic
feedback allow reductions of more than six times. - Once the codes are designed and stored,
complexity is almost negligible. - Time Frequency algorithms need refresh for
robustness. - Future OFDMA systems are closer to be implemented.
20Thank you very much