Incremental-redundancy transmission for meteor-burst communications

The performance of type-II hybrid automatic repeat request (ARQ) is compared to that of fixed-rate type-I hybrid ARQ for meteor-burst communications. Maximum throughput is obtained for meteor-burst communications by using a transmission scheme for which the information rate of the code, varies in response to the fluctuations in the power received from a meteor trail. For type-II hybrid ARQ, a variation in the code rate is inherent in the coding scheme. On the first transmission that is made for a data block, a code of relatively high rate is used, but if an additional transmission is required, only redundant symbols are sent, and this reduces the overall rate of the code. The performance measure is the throughput per trail, which is defined as the expected number of successfully received information bits for a given meteor trail. The authors also develop an approximation for the average value of the throughput, averaged over the parameters of the meteor trail. Numerical results for Reed-Solomon codes are included to illustrate the relative performance of the various schemes. It is shown that the throughput is larger for type-II hybrid ARQ than for either fixed-rate type-I hybrid ARQ or ARQ without forward-error-correction     

流星突发通信中的混合ARQ技术研究

流星突发通信是20世纪中期开始兴起的通信技术。它在可靠性、抗干扰性、生存能力以及费用上的优势使其在民用和军用领域得到广泛研究。主要对流星突发通信中的HARQ技术进行讨论,介绍了固定速率Ⅰ型、变速率Ⅰ型以及Ⅱ型HARQ的工作原理,进行了性能仿真和分析。仿真结果表明采用HARQ方案可以有效改善系统性能,增加吞吐量,Ⅱ型HARQ和变速率Ⅰ型HARQ的性能要优于固定速率Ⅰ型HARQ。     

Performance of H.263 video transmission over wireless channelsusing hybrid ARQ

This paper proposes a hybrid ARQ error control scheme based on the concatenation of a Reed-Solomon (RS) code and a rate compatible punctured convolutional (RCPC) code for low-bit-rate video transmission over wireless channels. The concatenated hybrid ARQ scheme we propose combines the advantages of both type-I and type-II hybrid ARQ schemes. Certain error correction capability is provided in each (re)transmitted packet, and the information can be recovered from each transmission or retransmission alone if the errors are within the error correction capability (similar to type-I hybrid ARQ). The retransmitted packet contains redundancy bits which, when combined with the previous transmission, result in a more powerful RS/convolutional concatenated code to recover information if error correction fails for the individual transmissions (similar to type-II hybrid ARQ). Bit-error rate (BER) or signal-to-noise ratio (SNR) of a radio channel changes over time due to mobile movement and fading. The channel quality at any instant depends on the previous channel conditions. For the accurate analysis of the performance of the hybrid ARQ scheme, we use a multistate Markov chain (MSMC) to model the radio channel at the data packet level. We propose a method to partition the range of the received SNR into a set of states for constructing the model so that the difference between the error rate of the real radio channel and that of the MSMC model is minimized. Based on the model, we analyze the performance of the concatenated hybrid ARQ scheme. The results give valuable insight into the effects of the error protection capability in each packet, the mobile speed, and the number of retransmissions. Finally, the transmission of H.263 coded video over a wireless channel with error protection provided by the concatenated hybrid ARQ scheme is studied by means of simulations     

MBC中的Ⅰ型HARQ改进方案

在流星突发通信中,为确保数据有效可靠地传输,通常采用前向纠错与自动重传请求相结合的方法,即HARQ。传统I型HARQ效率较低,难以满足大数据量通信。为了有效利用流星信道,建立了流星突发通信模型,提出了一种基于分集合并的Ⅰ型HARQ方案,推导出了有效信噪比公式,讨论了信噪比改善系数和最大重传次数,并进行了仿真。仿真结果表明,该方案可有效提高可靠性,增加吞吐量。     

A Modified Selective-Repeat Type-II Hybrid ARQ System and Its Performance Analysis

The hybrid ARQ scheme with parity retransmission for error control, recently proposed by Lin and Yu [1], [2], is quite robust. This scheme provides both high system throughput and high system reliability. In this paper, a modified Lin-Yu hybrid ARQ scheme is presented. The modified scheme provides a slightly better throughput performance than the original Lin-Yu scheme; however, it is more flexible in utilizing the error-correction power of a code. The modified scheme can be incorporated with a rate 1/2 convolutional code using Viterbi decoding. Furthermore, the pure selectiverepeat ARQ is a degenerated case of the modified scheme in selective mode. Lin and Yu analyzed their scheme only for a receiver buffer of sizeNwhereNis the number of data blocks that can be transmitted in a round-trip delay interval. No analysis for other buffer sizes was given. In this paper, the throughput performance of the modified Lin-Yu scheme is analyzed for any size of receiver buffer. Consequently, the throughput efficiency of the pure selective-repeat ARQ for any receiver buffer size can be obtained. We also show that the modified scheme achieves the same order of reliability as a pure ARQ scheme.     

Adaptive rate error control through the use of diversity combiningand majority-logic decoding in a hybrid-ARQ protocol

Diversity combining and majority-logic decoding are combined to create a simple but powerful hybrid automatic repeat request (ARQ) error control scheme. Forward-error-correcting (FEC) majority-logic decoders are modified for use in type-I hybrid-ARQ protocols through the identification of reliability information within the decoding process. Diversity combining is then added to reduce the number of retransmissions and their consequent impact on throughput performance. Packet combining has the added benefit of adapting the effective code rate to channel conditions. Excellent reliability performance coupled with a simple high-speed implementation makes the majority-logic system and ideal choice for high-data-rate error control over both stationary and nonstationary channels     

流星突发通信中的变速率编码方案研究

流星突发通信是一种利用流星余迹进行通信的短时、突发通信方式。如何在较短通信时间内尽可能多的实现数据的可靠传输,始终是研究者关注的问题。传统的固定速率编码方案无法很好地适应信道变化,因此提出变速率编码以提高系统性能。通过对两种方案研究,对变速率编码算法进行了改进。仿真结果表明,改进后的变速率编码方案可明显改善系统性能。     

An Adaptive Hybrid ARQ Scheme

A hybrid ARQ in which the transmitter adaptively selects an FEC code according to the channel condition is presented and analyzed. The code is selected according to the past transmissions and acknowledgements by an algorithm which is a generalization of that in [1]. The throughput is obtained as a function of the frame error rate for a general system employing the adaptive hybrid ARQ with acknowledgements that arrive instantly on an error-free return channel. The throughput is obtained as a function of the signal-to-noise ratio for an example quad rate system employing convolutional codes with non-coherent frequency shift keying over the uncorrelated Rayleigh fading channel. This allows the best choice for the parameters of the algorithm to be made. In the case that the channel bit errors are independent, the generalization offers performance improvement of less than 10% over that in [1]. But when the channel errors are bursty, as in the case of Rayleigh fading with finite bit interleaving, the generalization offers throughput improvement as high as 24%. We go on to consider incorporating code combining with the adaptive scheme to form an adaptive memory hybrid ARQ. Simulation of a system using complementary punctured convolutional codes with 4 code rates shows that 2-level code combining can extend the adaptive scheme's useful throughput into the low SNR region by approximately 4 dB.     

Variable-rate coding for meteor-burst communications

The performance of variable-rate Reed-Solomon error-control coding for meteor-burst communications is considered. The code rate is allowed to vary from codeword to codeword within each packet, and the optimum number of codewords per packet and optimum rates for the codewords are determined as a function of the length of the message and the decay rate for the meteor trail. The resulting performance is compared to that obtained from, fixed-rate coding. Of central importance is the derivation of tractable expressions for the probability of correct decoding for bounded-distance decoding on a memoryless channel with a time-varying symbol error probability. A throughout measure is developed that is based on the probability distribution of the initial signal-to-noise ratio     

A Comparison of Block and Convolutional Codes in ARQ Error Control Schemes

ARQ methods of error control can considerably improve the reliablity of data transmission in such areas as satellite communications, computer networks, etc. A number of ARQ schemes using both block and convolutional codes have appeared in the literature. In this paper, the following problem is addressed. Given two different implementations of an ARQ scheme, one using a block code and the other using a convolutional code, such that the bit error probability of both implementations does not exceed some specific value, which implementation has the higher throughput and under what conditions will it be attained? The comparison is made for three basic retransmission schemes using both hybrid and pure ARQ: stop-and-wait, go-back-N, and selective repeat. Numerical estimates of the throughput were obtained using approximate theoretical expressions for BCH codes and simulation results for sequential decoding of rate 1/2 convolutional codes. Parameters optimizing the performance of both block and convolutional codes for different channel conditions and round trip delays were found and were used to obtain these numerical estimates. Comparison of the quantitative results indicates a trend toward preferring convolutional codes as delay and/or block length increases. A binary symmetric channel with noiseless feedback was assumed. Possible implications for the Gaussian channel are also discussed.     

Burst-Error Correction Strategies in a Slotted DS-CDMA Mobile Satellite Channel

Various burst-error handling strategies exist to reduce the effects of bursts of errors such as those that characterise a heavily shadowed, slowly fading land mobile satellite channel using low earth orbit satellites (LEOS). It is proposed that a combination of the techniques with code rate adjustment and channel-state sensing leads to high performance gains for the direct sequence CDMA channel.This paper presents studies of the performance of code interleaving in co-ordination with code rate reduction in a channel with known burst statistics where provision is made for channel-state sensing. The results are compared with those from concatenated coding and hybrid automatic repeat request (hybrid ARQ) with selective repeat (SR).Results are presented for throughput and delay. The combination of the various techniques for specific channel conditions results in significant performance improvements in terms of throughput and average time delay. The proposed error-control technique offers significant performance gains over the use of hybrid ARQ, concatenated coding or interleaving in isolation.     

Adaptive SR-ARQ combined with STBC in Markov channels

The throughput and packet error rate for a selective-repeat ARQ scheme based on a constant-power variable-rate adaptive M-QAM system combined with orthogonal STBC in Nakagami Markovian channels is analysed. The impact of dwell-time on the performance of adaptive M-QAM is considered.     

Performance of Hybrid ARQ Schemes with ML Code Combining over a Block-Fading Rayleigh Channel

This paper considers two well-known selective-repeat retransmission schemes, namely, hybrid type-I ARQ and hybrid type-II ARQ, using convolutional coding, in conjunction with maximum-likelihood code combining. Our theoretical analysis, based upon the concept of generalized weight distribution, shows that the use of code combining yields a significant throughput at very high channel error rates not only in constant AWGN channels but also in fading channels. To demonstrate this, we consider a widely-used block-fading Rayleigh channel model, in which the channel is assumed to be constant during each block of data and the fading is assumed to be independent from block to block. A key parameter in designing retransmission protocols for delay-limited applications in such channels is the minimum number of retransmissions, needed to achieve error-free decoding at almost all channel conditions (low outage probability). This number can be reduced significantly when code combining is employed.     

A diversity combining DS/CDMA system with convolutional encodingand Viterbi decoding

Averaged diversity combining is applied to an asynchronous DS/CDMA system using convolutional encoding and Viterbi decoding. A cyclic redundancy check (CRC) code is included in the scheme to trigger retransmission requests. Multiple received packets are combined on a bit by bit basis to form a single, more reliable packet. The error correcting decoder operates on the combined packet, as opposed to the most recently received individual packet (e.g., as in a type-I hybrid ARQ protocol), substantially increasing the probability of acceptance with each additional transmission. We show that the proposed technique allows a significant increase in the CDMA system capacity, throughput, and reliability     

A novel adaptive hybrid ARQ scheme for wireless ATM networks

This paper describes the design and performance of a novel adaptive hybrid ARQ scheme using concatenated FEC codes for error control over wireless ATM networks. The wireless links are characterized by higher, time‐varying error rates and burstier error patterns in comparison with the fiber‐based links for which ATM was designed. The purpose of the hybrid ARQ scheme is to provide a capability to dynamically support reliable ATM‐based transport over wireless channels by using a combination of our ARQ scheme (called SDLP) and the concatenated FEC scheme. The key ideas in the proposed hybrid ARQ scheme are to adapt the code rate to the channel conditions using incremental redundancy and to increase the starting code rate as much as possible with the concatenated FEC, maximizing the throughput efficiency. The numerical results show that our proposed scheme outperforms other ARQ schemes for all SNR values. This revised version was published online in July 2006 with corrections to the Cover Date.     

流星突发通信中的增量冗余传输方案

在流星突发通信中,混合ARQ技术能有效保障数据传输的有效性和可靠性。文中通过对传统的增量冗余传输方案进行分析,提出了一种改进的短码字重传冗余HARQ方案,并对单条余迹下两个站点间的数据通信进行了仿真。理论分析和仿真结果表明,改进后的方案能有效抑制噪声干扰,增加吞吐量。     

ARQ strategies for relay cooperative systems

We propose two novel automatic repeat request (ARQ) strategies for relay cooperative systems over Rayleigh fading channel one uses relay ARQ and the other destination ARQ. The BER performance of these two strategies is derived in fast block fading. Numerical analysis and simulation show the systems can get more performance gain when the inter-channel (the source to the relay) quality is bad in the relay ARQ strategy. In the destination ARQ strategy, when the uplink qualities of the source and relay to the destination are poor, the average received SNR of the destination is much low, the systems performance can be improved efficiently.     

Hybrid ARQ schemes for point-to-multipoint communication overnonstationary broadcast channels

Hybrid automatic-repeat-request (ARQ) error control schemes make use of both error detection and error correction in order to achieve high throughput and low undetected error probabilities on two way channels. Two hybrid ARQ schemes, termed hybrid go-back-N (HGB- N) and hybrid selective-repeat (HSR), are proposed for point-to-multipoint communications over broadcast channels. Both schemes incorporate a concatenated code for error correction and error detection. The performance study of the hybrid schemes is based on a two-state Markov model of a burst noise channel. An analytic solution is derived for the throughput efficiency of the HSR scheme, while approximations and computer simulation are used to evaluate the throughput efficiency of the HGB-N scheme. It is shown that the schemes perform considerably better than the corresponding pure ARQ schemes in which a block code is used for error detection only, especially in environments with a large number of receivers and large channel roundtrip delays, such as satellite broadcast links     

Generalized type II hybrid ARQ scheme using punctured convolutionalcoding

A method is presented to construct rate-compatible convolutional (RCC) codes from known high-rate punctured convolutional codes, obtained from best-rate 1/2 codes. The construction method is rather simple and straightforward, and still yields good codes. Moreover, low-rate codes can be obtained without any limit on the lowest achievable code rate. Based on the RCC codes, a generalized type-II hybrid ARQ scheme, which combines the benefits of the modified type-II hybrid ARQ strategy of J. Hagenauer (1988) with the code-combining ARQ strategy of D. Chase (1985), is proposed and analyzed. With the proposed generalized type-II hybrid ARQ strategy, the throughput increases as the starting coding rage increases, and as the channel degrades, it tends to merge with the throughput of rate 1/2 type-II hybrid ARQ schemes with code combining, thus allowing the system to be flexible and adaptive to channel conditions, even under wide noise variations and severe degradations     

Performance of ARQ with Sequential Decoding Over One-Hop and Two-Hop Radio Links

The stop-and-wait ARQ protocol with convolutional code and sequential decoding is considered. The channel throughput and optimum time-out before retransmission are obtained and the effects of the link parameters discussed. The results are extended to a twohop radio link, where a repeater receives the source's data and forwards them on the same radio channel to the destination. The ARQ protocols for the source and the repeater are discussed and a method presented for choosing the optimum time-out intervals for both.