TY - JOUR
T1 - HARQ Buffer Management
T2 - An Information-Theoretic View
AU - Lee, Wonju
AU - Simeone, Osvaldo
AU - Kang, Joonhyuk
AU - Rangan, Sundeep
AU - Popovski, Petar
N1 - Funding Information:
The work of W. Lee and J. Kang was partly supported by the ICT R&D program of MSIP/IITP [R-20150225-000437, Next Generation Ultra-Low Latency/High Spectral Efficiency Wireless Access for Tactile Communication Services in IoT Environment]. The work of O. Simeone was partially supported by WWTF Grant ICT12-054 and by the U.S. National Science Foundation through grant CCF-1525629. The work of P. Popovski has been in part supported by the European Research Council (ERC Consolidator Grant Nr. 648382 WILLOW) within the Horizon 2020 Program. The associate editor coordinating the review of this paper and approving it for publication was B. Liang.
Publisher Copyright:
© 2015 IEEE.
PY - 2015/11
Y1 - 2015/11
N2 - A key practical constraint on the design of hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such as LTE and LTE-A, the HARQ buffer size is one of the main drivers of the modem area and power consumption. This has recently highlighted the importance of HARQ buffer management, that is, of the use of buffer-aware transmission schemes and of advanced compression policies for the storage of received data. This work investigates HARQ buffer management by leveraging information-theoretic achievability arguments based on random coding. Specifically, standard HARQ schemes, namely Type-I, Chase Combining, and Incremental Redundancy, are first studied under the assumption of a finite-capacity HARQ buffer by considering both coded modulation, via Gaussian signaling, and Bit Interleaved Coded Modulation (BICM). The analysis sheds light on the impact of different compression strategies, namely the conventional compression log-likelihood ratios and the direct digitization of baseband signals, on the throughput. The optimization of coding blocklength is also investigated, highlighting the benefits of HARQ buffer-aware transmission scheme.
AB - A key practical constraint on the design of hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such as LTE and LTE-A, the HARQ buffer size is one of the main drivers of the modem area and power consumption. This has recently highlighted the importance of HARQ buffer management, that is, of the use of buffer-aware transmission schemes and of advanced compression policies for the storage of received data. This work investigates HARQ buffer management by leveraging information-theoretic achievability arguments based on random coding. Specifically, standard HARQ schemes, namely Type-I, Chase Combining, and Incremental Redundancy, are first studied under the assumption of a finite-capacity HARQ buffer by considering both coded modulation, via Gaussian signaling, and Bit Interleaved Coded Modulation (BICM). The analysis sheds light on the impact of different compression strategies, namely the conventional compression log-likelihood ratios and the direct digitization of baseband signals, on the throughput. The optimization of coding blocklength is also investigated, highlighting the benefits of HARQ buffer-aware transmission scheme.
KW - BICM
KW - HARQ buffermanagement
KW - buffer-aware transmission
KW - quantization
UR - http://www.scopus.com/inward/record.url?scp=84959494642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959494642&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2015.2472015
DO - 10.1109/TCOMM.2015.2472015
M3 - Article
AN - SCOPUS:84959494642
SN - 0090-6778
VL - 63
SP - 4539
EP - 4550
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 11
M1 - 7219392
ER -