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     

Markov error structure for throughput analysis of adaptive modulation systems combined with ARQ over correlated fading channels

We introduce an analytical method that uses a finite-state Markov chain (FSMC) as an error model, for estimating the performance of adaptive modulation systems (AMSs) combined with automatic repeat request (ARQ) schemes in correlated slow fading channels. For the throughput performance evaluation of wireless packet networks, conventionally, we have assumed independent block fading, which may also be suitable to represent fast fading channels. However, in slow fading channels, error rates of consecutive packets are highly correlated and we cannot simply assume independent error structure in performance evaluations. We propose a multistate Markov error structure for AMS in correlated fading channels, which is also described by a finite-state Markov chain (FSMC) and we also present throughput-estimation methods for AMS combined with ARQ, using the proposed Markov error structure.     

Performance of Hybrid Error Control Schemes of Satellite Channels

The effectiveness of hybrid error control schemes involving forward error correction (FEC) and automatic repeat request (ARQ) is examined for satellite channels. The principal features of the channel are: large round-trip transmission delay due to the satellite link, and burst errors introduced by the terrestrial links that connect the users to the satellite link. The performance is estimated for two channels described by Fritchman's simple partitioned finite-state Markov model, and is compared to that obtainable if the channel is considered as a binary symmetric channel of the same bit error probability. Results show that the hybrid schemes offer substantial improvement over ARQ and FEC, and that an optimum exists for the number of errors corrected to obtain maximum throughput efficiency.     

相关衰落信道下的一种层间联合自适应SR-ARQ传输机制

传统自适应传输机制在相关慢衰落信道下有较差的系统性能.针对相关衰落信道,提出了一种层间联合自适应传输机制.利用有限状态马尔可夫链来描述相关衰落信道,同时通过构建一个多状态马尔可夫系统模型来分析系统吞吐性能,并对调制方式和传输分组大小进行优化.另外,推导了系统平均吞吐性能的表达式.仿真结果显示所提出的自适应传输机制在相关衰落信道上能获得更好的系统性能.     

Adaptive source rate control for real‐time wireless video transmission

Hybrid ARQ schemes can yield much better throughput and reliability than static FEC schemes for the transmission of data over time-varying wireless channels. However these schemes result in extra delay. They adapt to the varying channel conditions by retransmitting erroneous packets, this causes variable effective data rates for current PCS networks because the channel bandwidth is constant. Hybrid ARQ schemes are currently being proposed as the error control schemes for real-time video transmission. An important issue is how to ensure low delay while taking advantage of the high throughput and reliability that these schemes provide for. In this paper we propose an adaptive source rate control (ASRC) scheme which can work together with the hybrid ARQ error control schemes to achieve efficient transmission of real-time video with low delay and high reliability. The ASRC scheme adjusts the source rate based on the channel conditions, the transport buffer occupancy and the delay constraints. It achieves good video quality by dynamically changing both the number of the forced update (intracoded) macroblocks and the quantization scale used in a frame. The number of the forced update macroblocks used in a frame is first adjusted according to the allocated source rate. This reduces the fluctuation of the quantization scale with the change in the channel conditions during encoding so that the uniformity of the video quality is improved. The simulation results show that the proposed ASRC scheme performs very well for both slow fading and fast fading channels. This revised version was published online in July 2006 with corrections to the Cover Date.     

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.     

Trellis Coded Hybrid Selective Repeat ARQ Schemes for Point-to-Multipoint Communication over Rayleigh Fading Channels

In this paper, the hybrid selective repeat (SR) automatic repeat request (ARQ) scheme using trellis coded modulation (TCM) proposed by Tellambura and Bhargava [21] is generalized to point-to-multipoint communications for Rayleigh fading channel. Analytical expressions are derived for the throughputs of the point-to-multipoint communication schemes with and without code combining technique. Numerical results show that the protocol using code combining technique yields better throughput than the protocol without code combining and the throughputs decrease when the number of receivers and the value of erasure threshold increase. When the number of receivers equals 1, the scheme without code combining becomes the point-to-point communication scheme proposed in [21].     

Adaptive error coding using channel prediction

In this paper, we construct a finite-state Markov chain model for a Rayleigh fading channel by partitioning the range of the received signal envelope into K intervals. Using a simulation of the classic two-ray Rayleigh fading model, a Markov transition probability matrix is obtained. Using this matrix to predict the channel state, we introduce an adaptive forward error correction (FEC) coding scheme. Simulation results are presented to show that the adaptive FEC coding scheme significantly improves the performance of a wireless communication system.     

Blind equalization of dispersive fast fading Ricean channels via the EMV algorithm

A blind maximum likelihood equalization method is proposed for frequency selective fast fading Ricean channels. This method employs the expectation-maximization Viterbi algorithm (EMVA) developed in for blind channel estimation and signal detection. Since the Viterbi algorithm (VA) is used to execute the E-phase of an expectation-maximization (EM) iteration, it requires that the observed sequence can be modelled as a finite-state hidden Markov process. We develop a hidden Markov model for frequency selective fast fading Ricean channels, so that the observed process can be viewed as the noisy output of a finite state machine (FSM), to which the VA is applicable. The EMVA is then employed to obtain a blind maximum likelihood estimate of the specular part of the channel and, for one special case, of a noise parameter measuring the total power of the additive and multiplicative channel noise components. Simulation results are presented which show that the EMVA achieves an accurate estimate of the channel specular part and has an error rate performance close to that of the maximum likelihood detector based on true parameters for the given FSM model.     

Performance of hybrid ARQ for IP packet transmission on fadingchannel

This paper proposes and analyzes the performance of a hybrid selective repeat (SR)/multicopy (MC) automatic repeat request (ARQ) scheme to transmit fragmented Internet protocol (IP) packets. The ARQ scheme works in the SR mode until the last IP packet fragment is transmitted. If a fragment is negatively acknowledged after the last fragment is transmitted, then the system goes in the MC mode. In the MC mode, multiple copies of the erroneous fragment are transmitted. After all IP fragments are received without error, the system goes back to the SR mode. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER), IP packet size, and fragmentation size with and without Bose Chaudhuri Hocquenghem (BCH) error correction codes. Both the results are obtained under additive white Gaussian noise (AWGN) as well as flat Rayleigh fading channels. The proposed scheme gives a throughput of 0.9, even at high BER conditions, for any IP packet size under an AWGN channel while, an 8-dB improvement is achieved, when using BCH(63, 51, 2) for throughput of 0.9, over selective repeat+stutter scheme 2 (SR+ST 2) under a flat Rayleigh fading channel     

Finite-state Markov model for Rayleigh fading channels

We form a finite-state Markov channel model to represent Rayleigh fading channels. We develop and analyze a methodology to partition the received signal-to-noise ratio (SNR) into a finite number of states according to the time duration of each state. Each state corresponds to a different channel quality indicated by the bit-error rate (BER). The number of states and SNR partitions are determined by the fading speed of the channel. Computer simulations are performed to verify the accuracy of the model     

A Model for Correlated Rician Fading Channels Based on a Finite Queue

We study the problem of approximating the family of hard-decision frequency-shift keying demodulated correlated flat Rician fading channels via a recently introduced queue-based channel (QBC) model for binary communication channels with memory. For a given ldquodiscretizedrdquo fading channel, we construct a QBC whose noise process is statistically ldquocloserdquo in the Kullback-Leibler sense to the error or noise process that is generated by the fading channel, and the modeling accuracy is evaluated in terms of noise autocorrelation function (ACF) and channel capacity. Numerical results indicate that the QBC provides a good approximation of the fading channels for a wide range of channel conditions. Furthermore, it estimates the noise ACF more accurately than the finite-state Markov models that have been recently studied by Pimentel , while, at the same time, remaining mathematically tractable.     

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     

Finite-state Markov channel-a useful model for radio communicationchannels

The authors first study the behavior of a finite-state channel where a binary symmetric channel is associated with each state and Markov transitions between states are assumed. Such a channel is referred to as a finite-state Markov channel (FSMC). By partitioning the range of the received signal-to-noise ratio into a finite number of intervals, FSMC models can be constructed for Rayleigh fading channels. A theoretical approach is conducted to show the usefulness of FSMCs compared to that of two-state Gilbert-Elliott channels. The crossover probabilities of the binary symmetric channels associated with its states are calculated. The authors use the second-order statistics of the received SNR to approximate the Markov transition probabilities. The validity and accuracy of the model are confirmed by the state equilibrium equations and computer simulation     

ARQ error control for fading mobile radio channels

In this paper, we study the correlation properties of the fading mobile radio channel. Based on these studies, we model the channel as a one-step Markov process whose transition probabilities are a function of the channel characteristics. Then we present the throughput performance of the Go-Back-N and selective-repeat automatic repeat request (ARQ) protocols with timer control, using the Markov model for both forward and feedback channels. This approximation is found to be very good, as confirmed by simulation results     

Analysis of memory and incremental redundancy ARQ schemes over anonstationary channel

A generalized type II automatic-repeat-request (ARQ) scheme using punctured convolutional coding on a two-state Markov model of a nonstationary channel is analyzed. A simple ARQ scheme with memory is also analyzed. It is shown that the simple memory ARQ scheme offers a substantial throughput improvement over a conventional ARQ scheme at severe channel conditions. Furthermore, the generalized type II ARQ scheme yields a better performance than the conventional type II ARQ scheme under all channel conditions, thus making it attractive for use over time-varying channels     

A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding

A partial ordering on general finite-state Markov channels is given, which orders the channels in terms of probability of symbol error under iterative estimation decoding of a low-density parity-check (LDPC) code. This result is intended to mitigate the complexity of characterizing the performance of general finite-state Markov channels, which is difficult due to the large parameter space of this class of channel. An analysis tool, originally developed for the Gilbert-Elliott channel, is extended and generalized to general finite-state Markov channels. In doing so, an operator is introduced for combining finite-state Markov channels to create channels with larger state alphabets, which are then subject to the partial ordering. As a result, the probability of symbol error performance of finite-state Markov channels with different numbers of states and wide ranges of parameters can be directly compared. Several examples illustrating the use of the techniques are provided, focusing on binary finite-state Markov channels and Gaussian finite-state Markov channels. Furthermore, this result is used to order Gilbert-Elliott channels with different marginal state probabilities, which was left as an open problem by previous work.     

Capacity, mutual information, and coding for finite-state Markovchannels

The finite-state Markov channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel's mutual information is then a closed-form continuous function of the input distribution. We next consider coding for FSMCs. In general, the complexity of maximum-likelihood decoding grows exponentially with the channel memory length. Therefore, in practice, interleaving and memoryless channel codes are used. This technique results in some performance loss relative to the inherent capacity of channels with memory. We propose a maximum-likelihood decision-feedback decoder with complexity that is independent of the channel memory. We calculate the capacity and cutoff rate of our technique, and show that it preserves the capacity of certain FSMCs. We also compare the performance of the decision-feedback decoder with that of interleaving and memoryless channel coding on a fading channel with 4PSK modulation     

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.     

Cross-layer design based on RC-LDPC codes in MIMO channels with estimation errors

In this paper, we propose a cross-layer design framework combining adaptive modulation and coding (AMC) with hybrid automatic repeat request (HARQ) based on rate-compatible low-density parity-check codes (RC-LDPC) in multiple-input multiple-output (MIMO) fading channels with estimation errors. First, we propose a new puncturing pattern for RC-LDPC codes and demonstrate that the new puncturing pattern performs similar to the random puncturing but is easier to apply. Then, we apply RC-LDPC codes with the new puncturing pattern to the cross-layer design combing AMC with ARQ over MIMO fading channels and derive the expressions for the throughput of the system. The effect of channel estimation errors on the system throughput is also investigated. Numerical results show that the joint design of AMC and ARQ based on RC-LDPC codes can achieve considerable spectral efficiency gain.