Farshad Lahouti

Analysis of Non-Cooperative and Cooperative Type II Hybrid ARQ Protocols with AMC over Correlated Fading Channels

This paper presents performance analysis and cross-layer design approaches for hybrid ARQ (HARQ) protocols in wireless networks, which employ adaptive modulation and coding (AMC) in conjunction with adaptive cooperative diversity and are subject to time-correlated fading channels. We first consider a point-to-point scenario, i.e., non-cooperative HARQ with AMC. Utilizing a Markov channel model which accounts for the temporal correlation in the successive transmission of incremental redundancy by the HARQ protocol, we derive the system throughput and the packet loss probability based on a rate compatible punctured convolutional code family. Next, we consider a cooperative HARQ (CHARQ) scheme in which a relay node, also equipped with AMC, retransmits redundancy packets when it is able to decode the source information packet correctly. For this scenario, we also derive the throughput and packet loss performance. Finally, we present a cross-layer AMC design approach which takes into account the hybrid ARQ protocol at the link layer. The results illustrate that including AMC in the HARQ protocols leads to a substantial throughput gain. While the performance of the AMC with HARQ protocol is strongly affected by the channel correlation, the CHARQ protocol provides noticeable performance gains over correlated fading channels as well.

A new method of channel feedback quantization for high data rate MIMO systems

In this work, we study a multiple-input multiple-output wireless system, where the channel state information is partially available at the transmitter through a feedback link. Based on singular value decomposition, the MIMO channel is split into independent subchannels, which allows separate, and therefore, efficient decoding of the transmitted data signal. Effective feedback of the required spatial channel information entails efficient quantization/encoding of a Haar unitary matrix. The parameter reduction of an n /spl times/ n unitary matrix to its n/sup 2/ - n basic parameters is performed through Givens decomposition. We prove that Givens matrices of a Haar unitary matrix are statistically independent. Subsequently, we derive the probability distribution function (PDF) of the corresponding matrix elements. Based on these analyses, an efficient quantization scheme is proposed. The performance evaluation is provided for a scenario where the rates allocated to each independent channel are selected according to its corresponding gain. The results indicate a significant performance improvement compared to the performance of MIMO systems without feedback at the cost of a very low-rate feedback link.

Joint adaptive modulation-coding and cooperative ARQ for wireless relay networks

This paper presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) protocol at the data link layer. We first derive an exact closed form expression for the spectral efficiency of the proposed joint AMC - cooperative ARQ scheme. Aiming at maximizing this system performance measure, we then optimize an AMC scheme which directly satisfies a prescribed packet loss rate constraint at the data-link layer. The results indicate that utilizing cooperative ARQ as a retransmission strategy, noticeably enhances the spectral efficiency compared with the system that employs AMC alone at the physical layer. Moreover, the proposed adaptive rate cooperative ARQ scheme outperforms the fixed rate counterpart when the transmission modes at the source and relay are chosen based on the channel statistics. This in turn quantifies the possible gain achieved by joint design of AMC and ARQ in wireless relay networks.

Adaptive transmission policy design for delay-sensitive and bursty packet traffic over wireless fading channels

In this paper, we consider the problem of transmission of a delay-sensitive and bursty traffic source over a time-varying Nakagami-m fading channel in a cross-layer optimization framework. Aiming at minimizing the packet delay due to queuing at the data link layer, we present power and rate adaptation policies for coded M-QAM modulation schemes, which guarantee a prescribed channel packet error rate constraint. This is also equivalent to minimizing the system packet loss rate. The proposed adaptation policies are derived both for block and correlated channel fading scenarios. To enable the transmission policy design, we use a statistical model to characterize the packet delay derived from a known result of large deviations theory. Considering the error resolution capability of the automatic repeat request protocol, we then provide the appropriate analytical tools to incorporate the effect of packet retransmission in the proposed optimization framework for transmission policy design. The results show that the proposed adaptation policies compared to others adaptive solutions, significantly improve the delay and throughput performance for delay-sensitive bursty traffic over time-varying fading channels.

Single and double frame coding of speech LPC parameters using a lattice-based quantization scheme

A lattice-based scheme for the single-frame and the double-frame quantization of the speech line spectral frequency parameters is proposed. The lattice structure provides a low-complexity vector quantization framework, which is implemented using a trellis structure. In the single-frame scheme, the intraframe dependencies are exploited using a linear predictor. In the double-frame scheme, the parameters of two consecutive frames are jointly quantized and hence the interframe dependencies are also exploited. A switched scheme is also considered in which, lattice-based double-frame and single-frame quantization is performed for each two frame and the one which results in a lower distortion is chosen. Comparisons to the Split-VQ, the Multi-Stage VQ, the Trellis Coded Quantization, the interframe Block-Based Trellis Quantizer, and the interframe scheme used in IS-641 EFRC and the GSM AMR codec are provided. These results demonstrate the effectiveness of the proposed lattice-based quantization schemes, while maintaining a very low complexity. Finally, the issue of the robustness to channel errors is investigated

Link adaptation for physical layer security over wireless fading channels

A secure link adaptation framework is proposed, which exploits the inherent fluctuations of wireless fading channels for high-performance communications and physical layer security in the presence of an eavesdropper. The authors use very sharp channel codes intended for reliability and demonstrate that they also provide security, when successfully incorporated in the link adaptation design framework and the security constraint is not very stringent. Two scenarios are considered in which the transmitter has access to the eavesdropper channel state information either instantaneously or statistically. The proposed secure link adaptation framework is formulated to maximise the spectral efficiency of the communication, whereas both reliability and security constraints are provisioned. Different designs are considered when the security constraint is quantified by instantaneous bit error rate (BER), average BER or leakage probability. For the problem with instantaneous BER constraint, an efficient analytical solution and a numerical solution are presented. A closed-form analytical solution is also provided for secure link adaptation with average BER constraint, whereas the problem with the leakage constraint is tackled numerically. Extensive results and detailed analysis are provided to draw insights on the effects of different design parameters on the performance.

Robust network coding against path failures

In this study, an approach for robust network coding is introduced for multicast in a directed acyclic network in the presence of network edge failures. The proposed designs aim at combating the resulting path failures, which result in interestingly scalable solutions. A robust network coding scheme (RNC1) is proposed that, devising a rate-path diversity trade-off for the receivers, attains the post-failure capacity of the network with high probability. The scheme is receiver based and can also be applied for correcting random erasures. Next, a rate-guaranteed robust network coding scheme (RNC2) is proposed. The code guarantees the maximum rate for a predetermined number of path failures. The scheme, of course, attains the refined Singleton bound for the edge failure model. A path failure may not necessarily reduce the network capacity, as the remaining intact edges within the network may still facilitate backup paths from the source to the sinks. We introduce RNC3 to employ such backup paths in addition to the original paths and guarantee multicast at a certain rate in the presence of all edge/path failure patterns that do not reduce the capacity below this rate. All the three proposed schemes for multicast are robust to a number of edge failures that may, in general, exceed the refined Singleton bound. Our analyses indicate that the design complexities and the required field sizes grow as a function of the number of network paths, as opposed to the number of network edges because of prior schemes.

Link-Adaptive and QoS-Provisioning Cooperative ARQ—Applications to Relay-Assisted Land Mobile Satellite Communications

In a cooperative relay network, a relay (R) node may facilitate data transmission to the destination (D) node when the latter node cannot correctly decode the source (S) node data. This paper considers such a system model and presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and the truncated cooperative automatic repeat request (C-ARQ) protocol at the data-link layer for quality-of-service (QoS)-constrained applications. The average spectral efficiency and packet loss rate of the joint C-ARQ and AMC scheme are first derived in closed form. Aiming to maximize the system spectral efficiency, AMC schemes for the S-D and R-D links are optimized, whereas a prescribed packet-loss-rate constraint is satisfied. As an interesting application, joint link adaptation and blockage mitigation in land mobile satellite communications (LMSC) with temporally correlated channels is then investigated. In LMSC, the S node data can be delivered to the D node when the S-D is in the outage, therefore provisioning the QoS requirements. For applications without instantaneous feedback, an optimized rate selection scheme based on the channel statistics is also devised. Detailed and insightful numerical results are presented, which indicate the superior performance of the proposed joint AMC and C-ARQ schemes over their optimized joint AMC and traditional ARQ counterparts.

Link Adaptation with Untrusted Relay Assignment: Design and Performance Analysis

In this paper, a link adaptation and untrusted relay assignment (LAURA) framework for efficient and reliable wireless cooperative communications with physical layer security is proposed. Using sharp channel codes in different transmission modes, reliability for the destination and security in the presence of untrusted relays (low probability of interception) are provided through rate and power allocation. Within this framework, several schemes are designed for highly spectrally efficient link adaptation and relay selection, which involve different levels of complexity and channel state information requirement. Analytical and simulation performance evaluation of the proposed LAURA schemes are provided, which demonstrates the effectiveness of the presented designs. The results indicate that power adaptation at the source plays a critical role in spectral efficiency performance. Also, it is shown that relay selection based on the signal to noise ratio of the source to relays channels provides an interesting balance of performance and complexity within the proposed LAURA framework.

Quality of service constrained throughput optimisation for joint adaptive transmission with automatic repeat request over block-fading channels

An optimisation framework for wireless link adaptation which maximises the system throughput subject to a packet-level quality of service (QoS) constraint is presented. The authors consider joint adaptive variation of the transmitted power level, transmission data rate and packet-error-rate (PER) at the physical layer to improve the throughput performance of the selective-repeat automatic repeat request (SR-ARQ) protocol over block-fading channels. Specifically, for discrete-rate coded M-QAM schemes, the authors present a power and rate adaptation algorithm that guarantees a target PER constraint. The proposed framework also facilitates optimising the throughput performance for delay constrained wireless applications, which imposes a limit on the number of retransmissions for the ARQ. In particular, a link adaptation scheme is presented, which guarantees a target packet-loss rate (PLR) when a truncated SR ARQ protocol at the data-link layer is employed. Numerical results indicate that the proposed adaptation schemes compared with other adaptive schemes noticeably enhance the system throughput. Also, in the case of truncated ARQ, the results illustrate a fundamental trade-off between the delay and PLR QoS metrics achieved at the maximum throughput performance.