完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | LEE, TH | en_US |
dc.date.accessioned | 2014-12-08T15:04:45Z | - |
dc.date.available | 2014-12-08T15:04:45Z | - |
dc.date.issued | 1992-11-01 | en_US |
dc.identifier.issn | 0018-9545 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/25.182587 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/3250 | - |
dc.description.abstract | This paper studies the throughput performance of a class of continuous automatic repeat request (ARQ) strategies for burst-error channels modeled by two-state Markov chains. The operation of the investigated ARQ strategies can be described as follows. A chunk of m or fewer copies of each data block is transmitted contiguously to the receiver. Whenever a repeat request is received, the transmitter goes back to and retransmits that data block and all successive ones. However, the maximal number of copies transmitted is equal to n in each retransmission. It is proved that the optimal repetition sequence which maximizes the throughput efficiency among a more general set of ARQ schemes falls in the class of investigated strategies. Numerical results reveal that throughput efficiency is very likely to be maximized at m = n. | en_US |
dc.language.iso | en_US | en_US |
dc.title | THROUGHPUT PERFORMANCE OF A CLASS OF CONTINUOUS ARQ STRATEGIES FOR BURST-ERROR CHANNELS | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/25.182587 | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | en_US |
dc.citation.volume | 41 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 380 | en_US |
dc.citation.epage | 386 | en_US |
dc.contributor.department | 電信工程研究所 | zh_TW |
dc.contributor.department | 電信研究中心 | zh_TW |
dc.contributor.department | Institute of Communications Engineering | en_US |
dc.contributor.department | Center for Telecommunications Research | en_US |
dc.identifier.wosnumber | WOS:A1992KJ70800008 | - |
dc.citation.woscount | 3 | - |
顯示於類別: | 期刊論文 |