對於使用封包交換的無線網路來說，利用增量冗餘(Incremental redundancy)或闕斯合併(Chase-combining)的混合式重傳機制在控制錯誤的系統中是非常有效率的。相較於傳統的自動重傳機制，他們通常能提供較好的錯誤比率效果並且有較高的吞吐量。
在本文中，我們針對這幾種協定衍伸出的一些適應性調變系統分析了他們的吞吐量和延遲效能。在我們的系統裡面，編碼和調變機制主要都是根據IEEE 802.16e的規格，採用的分別是迴旋渦輪碼(convolutional turbo code)以及四相位移鍵訊號(QPSK)、16正交振幅調變(16QAM)和64正交振幅調變(64QAM)。我們考慮了加法性白色高斯雜訊(AWGN)和平坦瑞利衰落(flat Rayleigh fading)的環境。而在分析中，我們需要利用計算多維生成函數(generating function)來描繪轉換域(transform domain)的隱馬爾可夫程序(hidden Markov process)。我們提供了一些數值例子來展現並比較這兩種機制的效果，一般而言，增量冗餘的方式在兩種通道中都有較佳的性能比現。

Incremental redundancy (IR) or Chase-combining (CC) based hybrid ARQ (HARQ) protocols are very efficient error-control schemes for packet-switching wireless networks. With proper design, they outperform other ARQ protocols in both latency and throughput.
In this thesis we analyze the throughput and delay performance of several variations of these protocols with adaptive modulation. The coding and modulation schemes used
in our system are primarily based on the IEEE 802.16e standard, i.e., convolutional turbo code (CTC), QPSK, 16QAM, and 64QAM, respectively. Both AWGN and flat
Rayleigh fading environments are considered. Our analysis calls for the evaluation of the multi-dimensional generating function that characterizes the transform domain behavior of the underlying hidden Markov process. Numerical examples are provided for assessing the two classes of protocols. It is shown that, as far as performance is concerned, IR is a better choice although CC is easier to implement.

1 Introduction 1
2 Overview of the IEEE 802.16e Hybrid ARQ Mechanism 4
2.1 Padding 4
2.2 CRC encoding 5
2.3 Fragmentation 6
2.4 Randomization 6
2.5 Convolutional turbo codes(CTC) 6
2.5.1 CTC encoder 6
2.5.2 CTC interleaver 8
2.5.3 Determination of CTC circulation states 9
2.5.4 Subpacket generation 10
2.5.4.1 Symbol separation 11
2.5.4.2 Subblock interleaving 11
2.5.4.3 Symbol grouping 13
2.5.4.4 Symbol selection 14
2.6 Modulation order of DL tra±c burst 15
2.7 Date modulation 16
2.8 TDD vs. FDD mode 17
3 Turbo Decoding: Structure and Algorithm 26
3.1 Decoding CTC-coded Signals 26
3.1.1 Demapper 27
3.1.2 Soft-in soft-out Turbo decoder 29
4 Hybrid ARQ Techniques 34
4.1 Conventional HARQ methods 34
4.2 Packet combining methods 35
4.2.1 Symbol combining 35
4.2.2 LLR combining 36
4.2.3 Performance comparison 37
4.3 Compare Chase combining and Incremental redundancy 37
4.4 An adaptive Type-II Hybrid ARQ method 38
4.5 Numerical Results 40
5 Conclusion 46

[1] S. Lin and D. J. Costello, Jr., Error Control Coding : Fundamentals and Applications, Englewood Cli®s, NJ: Prentice Hall, 1983

[2] F. Babich, E. Valentinuzzi, and F. Vatta, "Performance of hybrid ARQ schemes for the LEO satellite channel", Proc. IEEE GLOBECOM 2001, San Antonio, TX, vol. 4, pp.2709-2713, Nov.2001

[3] C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes", IEEE Trans. Commun., vol. 44, no. 10 pp. 1261-1271, Oct. 1996

[4] D. Divalar and F. Pollara, "Multiple Turbo codes for deepspace communications", JPA TDA Progress Reports, vol. 42, pp. 66-77, May 1995

[5] D. Divalar and F. Pollara, "Turbo codes for PCS applications", Proc. IEEE ICC'95, Seattle, WA, vol. 1, pp. 54-59, June 1995

[6] D. Chase, "Code combining - A maximum likelihood decoding approach for combining an arbitrary number of noisy packets", IEEE Tran, on Commun., vol. 38, No. 8, Aug. 1990

[7] S. Kallel, "Analysis of a Type II Hybrid ARQ Schemes with code combining", IEEE Journal on selected Area in Commun. vol.Sac-2 No. 4, July 1984

[8] Yingzi Gao, Soleymani, M.R., "Triple-binary circular recursive systematic convolutional Turbo codes", the 5th International Symposium on Wireless personal Multimedia Communications, Volume 3, 27-30 Oct. 2002 Page(s):951 - 955 vol.3

[9] C. Zhan, T.Arslan, A. T. Erdogan, S. MacDougall, "An e±cient decoder scheme for double binary circular turbo codes" Vololume 4, 2006 Page(s):IV - IV Digital Object Identi‾er 10.1109/ICASSP.2006.1660947

[10] D. Molkdar, W. Featherstone and S. Lambotharan, "An overview of EGPRS: the packet data component of EDGE"