Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TCOMM.2005.863724
- Scopus: eid_2-s2.0-33646906441
- WOS: WOS:000237852500022
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Optimum subpacket transmission for hybrid ARQ systems
Title | Optimum subpacket transmission for hybrid ARQ systems |
---|---|
Authors | |
Keywords | Convolutional codes Cyclic redundancy check (CRC) codes Hybrid automatic-repeat-request (ARQ) systems Packet schemes Packet-error patterns Punctured codes |
Issue Date | 2006 |
Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26 |
Citation | Ieee Transactions On Communications, 2006, v. 54 n. 5, p. 934-942 How to Cite? |
Abstract | Hybrid automatic-repeat-request (ARQ) is a flexible and efficient technique for data transmissions. In hybrid ARQ, subpacket schemes are more attractive for systems with burst errors than complete packet schemes. Although subpacket schemes were proposed in ARQ systems, optimum subpacket transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes have properties of burst errors in decoding, the optimum subpacket can be applied to convolutional codes. This paper investigates the performance of subpacket transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of subpackets, and adaptive subpacket schemes, i.e., schemes that enable a system to employ different optimum numbers of subpackets under various conditions, are suggested to achieve the maximum throughput of the system. Numerical and simulation results show that the adaptive subpacket 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 subpacket scheme can be flexibly used with packet combining techniques to further improve the system throughput. © 2006 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/44740 |
ISSN | 2023 Impact Factor: 7.2 2020 SCImago Journal Rankings: 1.468 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, Y | en_HK |
dc.contributor.author | Wang, J | en_HK |
dc.date.accessioned | 2007-10-30T06:09:10Z | - |
dc.date.available | 2007-10-30T06:09:10Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Ieee Transactions On Communications, 2006, v. 54 n. 5, p. 934-942 | en_HK |
dc.identifier.issn | 0090-6778 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/44740 | - |
dc.description.abstract | Hybrid automatic-repeat-request (ARQ) is a flexible and efficient technique for data transmissions. In hybrid ARQ, subpacket schemes are more attractive for systems with burst errors than complete packet schemes. Although subpacket schemes were proposed in ARQ systems, optimum subpacket transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes have properties of burst errors in decoding, the optimum subpacket can be applied to convolutional codes. This paper investigates the performance of subpacket transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of subpackets, and adaptive subpacket schemes, i.e., schemes that enable a system to employ different optimum numbers of subpackets under various conditions, are suggested to achieve the maximum throughput of the system. Numerical and simulation results show that the adaptive subpacket 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 subpacket scheme can be flexibly used with packet combining techniques to further improve the system throughput. © 2006 IEEE. | en_HK |
dc.format.extent | 503590 bytes | - |
dc.format.extent | 1751 bytes | - |
dc.format.extent | 2319 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26 | en_HK |
dc.relation.ispartof | IEEE Transactions on Communications | en_HK |
dc.rights | ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Convolutional codes | en_HK |
dc.subject | Cyclic redundancy check (CRC) codes | en_HK |
dc.subject | Hybrid automatic-repeat-request (ARQ) systems | en_HK |
dc.subject | Packet schemes | en_HK |
dc.subject | Packet-error patterns | en_HK |
dc.subject | Punctured codes | en_HK |
dc.title | Optimum subpacket transmission for hybrid ARQ systems | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0090-6778&volume=54&issue=5&spage=934&epage=942&date=2006&atitle=Optimum+subpacket+transmission+for+hybrid+ARQ+systems | en_HK |
dc.identifier.email | Zhou, Y:yqzhou@eee.hku.hk | en_HK |
dc.identifier.authority | Zhou, Y=rp00214 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/TCOMM.2005.863724 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33646906441 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33646906441&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 54 | en_HK |
dc.identifier.issue | 5 | en_HK |
dc.identifier.spage | 934 | en_HK |
dc.identifier.epage | 942 | en_HK |
dc.identifier.isi | WOS:000237852500022 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Zhou, Y=7405367062 | en_HK |
dc.identifier.scopusauthorid | Wang, J=11439898400 | en_HK |
dc.identifier.issnl | 0090-6778 | - |