Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-5lx2p Total loading time: 0 Render date: 2024-07-29T02:32:33.331Z Has data issue: false hasContentIssue false

12 - Sub-packet transmission for hybrid ARQ systems

from Part IV - 4G mobile communications

Published online by Cambridge University Press:  27 May 2010

Jiangzhou Wang
Affiliation:
University of Kent, Canterbury
Get access

Summary

ARQ is a flexible and efficient technique for data transmissions. In hybrid ARQ, sub-packet schemes are more attractive for systems with burst errors than complete packet schemes. Although sub-packet schemes were proposed in ARQ systems, optimum sub-packet transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes are burst errors in decoding, the optimum sub-packet can be applied to convolutional codes. This chapter investigates the performance of sub-packet transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of sub-packets, and adaptive sub-packet schemes, i.e. schemes that enable a system to employ different optimum numbers of sub-packets under various conditions, are suggested to achieve maximum throughput in the system. Numerical and simulation results show that the adaptive sub-packet scheme is very effective for the convolutionally coded hybrid ARQ system, and it can provide higher throughput, smaller delay and lower dropping rate than complete packet schemes. Moreover, the adaptive sub-packet scheme can be flexibly used with packet combining techniques to further improve system throughput.

Introduction

In high-speed data communication systems, information sequences are transmitted usually in packets with fixed length. At a receiver, error correction and detection are carried out on the whole packet. If the packet is found in error, the receiver sends a request to the transmitter via a feedback channel, and then the whole packet is retransmitted. However, such a conventional complete-packet ARQ scheme is inefficient in the presence of burst errors.

Type
Chapter
Information
High-Speed Wireless Communications
Ultra-wideband, 3G Long Term Evolution, and 4G Mobile Systems
, pp. 296 - 312
Publisher: Cambridge University Press
Print publication year: 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Guo, N., Khaleghi, F., Gutierrez, A., Li, J. and Fong, M.-H., “Transmission of high speed data in cdma2000,” in Proc. IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1442–1445, 1999.
3rd Generation Partnership Project, Technical Specification Group Radio Access Network, “Multiplexing and channel coding (FDD), (Release 1999),” ETSI TS 25 212 V3.5.0, Dec. 2000.
Herzberg, H. and Poltyrev, G., “The error probability of M-ary PSK block coded modulation schemes,” IEEE Trans. Commun., vol. 44, pp. 427–433, April 1996.CrossRefGoogle Scholar
Poltyrev, G., “Bounds on the decoding error probability of binary linear codes via their spectra,” IEEE Trans. Inform. Theory, vol. 40, no. 4, pp.1282–1292, July 1994.Google Scholar
Sason, I. and Shamai, S., “Improved upper bounds on the maximum likelihood decoding error probability of parallel and serial concatenated Turbo codes via their ensemble distance spectrum,” IEEE Trans. Inform. Theory, vol. 46, pp. 24–47, Jan. 2000.CrossRefGoogle Scholar
Lin, S. and Costello, D. J. Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1984.Google Scholar
Bahl, L. R., Cullum, C. D., Frazer, W. D. and Jelinek, F., “An efficient algorithm for computing the free distance,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 437–439, Nov. 1972.Google Scholar
Larsen, K. L., “Comments on ‘An efficient algorithm for computing the free distance’ by Bahl et al.,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 577–579, July 1973.Google Scholar
Cedervall, M. and Johannesson, R., “A fast algorithm for computing distance spectrum of convolutional codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 1146–1159, Nov. 1989.CrossRefGoogle Scholar
R. J. McEliece, “How to compute weight enumerators for convolutional codes,” in Communication and Coding, Darnell, M. and Honary, B., eds. Taunton, UK: Research Studies Press, pp. 121–141, 1998.Google Scholar
Chase, D., “Code combining – a maximum-likelihood decoding approach for combining an arbitrary number of noisy packets,” IEEE Trans. Commun., vol. COM-33, pp. 385–393, May 1985.CrossRefGoogle Scholar
Harvey, B. A. and Wicker, S. B., “Packet combining systems based on the Viterbi decoder,” IEEE MILCOM'92, pp. 757–762, Oct. 1992.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×