On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0/spl les/r/spl les/1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint.     

Approaching the Outage Probability of the Amplify-and-Forward Relay Fading Channel

We study coding techniques for the single-relay non-orthogonal amplify-and-forward half-duplex relay fading channel. Unlike the multiple-antenna case, we show that 2times2 rotations induce large gains in outage probability with no increase in decoding complexity under iterative probabilistic decoding. We compare rotated and unrotated turbo-coded schemes and show that they both perform close to their corresponding outage limits.     

Breadth-First Signal Decoder: A Novel Maximum-Likelihood Scheme for Multi-Input–Multi-Output Systems

A number of decoding schemes have recently been proposed to perform maximum-likelihood (ML) detection for multi-input-multi-output (MIMO) systems. In this paper, employing a ldquobreadth-firstrdquo search algorithm for closet points in a lattice, we propose a novel ML decoding scheme called the breadth-first signal decoder (BSIDE). Through analysis and computer simulations, it is shown that the BSIDE has the same bit-error-rate performance as the conventional ML decoders while allowing significantly lower computational complexity. In addition, we introduce a simple tuning scheme that allows the BSIDE to have a performance-complexity tradeoff capability as necessary.     

Correlated sources over wireless channels: cooperative source-channel coding

We consider wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector node. This creates a many-to-one data gathering wireless channel. One of the main challenges in this scenario is that the source/channel separation theorem, proved by Shannon for point-to-point links, does not hold any more. In this paper, we construct novel cooperative source-channel coding schemes that exploit the wireless channel and the correlation between the sources. In particular, we differentiate between two distinct cases. The first case assumes that the sensor nodes are equipped with receivers and, hence, every node can exploit the wireless link to distribute its information to its neighbors. We then devise an efficient deterministic cooperation strategy where the neighboring nodes act as virtual antennas in a beamforming configuration. The second, and more challenging, scenario restricts the capability of sensor nodes to transmit only. In this case, we argue that statistical cooperative source-channel coding techniques still yield significant performance gains in certain relevant scenarios. Specifically, we propose a low complexity cooperative source-channel coding scheme based on the proper use of low-density generator matrix codes. This scheme is shown to outperform the recently proposed joint source-channel coding scheme (Garcia-Frias et al., 2002) in the case of highly correlated sources. In both the deterministic and statistical cooperation scenarios, we develop analytical results that guide the optimization of the proposed schemes and validate the performance gains observed in simulations.     

A Computationally Efficient QR-Successive Interference Cancellation Scheme for Simplified Receiver Implementation in SFBC-OFDM Systems

In this paper, we propose a computationally efficient square-root and division free recursive QR (SDRQR) decomposition based successive interference cancellation (SIC) receiver for space-frequency block coded orthogonal frequency division multiplexing (SFBC-OFDM) transmit diversity schemes. The performance of the proposed SDRQR-SIC receiver is semi- analytically evaluated taking into account the effects of channel estimation errors and error propagation during SIC. In addition, performance and complexity comparisons are drawn with previously proposed approaches. These comparisons show an excellent performance-complexity tradeoff achieved by SDRQR-SIC over the previous solutions under various channel conditions.     

On Trellis Shaping for PAR Reduction in OFDM Systems

The application of trellis shaping was proposed to reduce the peak-to-average power ratio (PAR) of orthogonal frequency division multiplexing (OFDM) signals. In this letter, we review the trellis-shaping schemes presented in the literature, and we introduce modifications such as a new decoding metric and the use of sequential decoding. We conduct comprehensive complexity and performance comparisons for the different schemes, and one interesting result of this work is that, in terms of PAR-reduction capability, trellis shaping with time-domain metrics is generally superior to trellis shaping with frequency-domain metrics. Furthermore, the proposed modifications enable trellis shaping for PAR reduction with a flexible performance-complexity tradeoff.     

Design of irregular LDPC codes with optimized performance-complexity tradeoff

The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a numerical approach for the minimization of decoding complexity for long-block-length irregular low-density parity-check (LDPC) codes. The proposed design methodology is applicable to any binary-input memoryless symmetric channel and any iterative message-passing decoding algorithm with a parallelupdate schedule. A key feature of the proposed optimization method is a new complexity measure that incorporates both the number of operations required to carry out a single decoding iteration and the number of iterations required for convergence. This paper shows that the proposed complexity measure can be accurately estimated from a density-evolution and extrinsicinformation transfer chart analysis of the code. A sufficient condition is presented for convexity of the complexity measure in the variable edge-degree distribution; when it is not satisfied, numerical experiments nevertheless suggest that the local minimum is unique. The results presented herein show that when the decoding complexity is constrained, the complexity-optimized codes significantly outperform threshold-optimized codes at long block lengths, within the ensemble of irregular codes.     

An efficient decoding algorithm for block turbo codes

An efficient soft-input soft-output iterative decoding algorithm for block turbo codes (BTCs) is proposed. The proposed algorithm utilizes Kaneko's (1994) decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decisions using reliability calculations. Three different schemes for reliability calculations incorporating different levels of approximation are suggested. The algorithm proposed here presents a major advantage over existing decoding algorithms for BTCs by providing ample flexibility in terms of performance-complexity tradeoff. This makes the algorithm well suited for wireless multimedia applications. The algorithm can be used for optimal as well as suboptimal decoding. The suboptimal versions of the algorithm can be developed by changing a single parameter (the number of error patterns to be generated). For any performance, the computational complexity of the proposed algorithm is less than the computational complexity of similar existing algorithms. Simulation results for the decoding algorithm for different two-dimensional BTCs over an additive white Gaussian noise channel are shown. A performance comparison of the proposed algorithm with similar existing algorithms is also presented     

Differential Relay Strategies Over Downlink Channel in Two-User Cooperative Communication System

In this paper, we propose two differential relaying strategies; Active User Strategy (AUS) and Passive Users Relaying Strategy (PURS), which could be used by the base-station to transmit data of two users over downlink channels in a two-user cooperative communication network. Differential schemes are used so the users do not require the knowledge of channel gains for decoding of their data. The performance of both schemes is evaluated for the decode-and-forward, selection relaying, and incremental relaying protocols. For the decode-and-forward protocol, the performance heavily depends upon the signal-to-noise ratio (SNR) of the link between source and relay. We propose a conditional probability of error based approach, which can be used to regulate the erroneous relaying of data. Both AUS and PURS are able to achieve performance gains as compared to the direct transmission differential scheme in the case of selection relaying and incremental relaying protocols at high SNRs. The proposed schemes perform better than their counterpart of the amplify-and-forward differential relaying proposed previously.     

Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels

This paper considers communication over coherent multiple-input multiple-output (MIMO) flat-fading channels where the channel is only known at the receiver. For this setting, we introduce the class of LAttice Space-Time (LAST) codes. We show that these codes achieve the optimal diversity-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding. Our scheme is based on a generalization of Erez and Zamir mod-/spl Lambda/ scheme to the MIMO case. In our construction the scalar "scaling" of Erez-Zamir and Costa Gaussian "dirty-paper" schemes is replaced by the minimum mean-square error generalized decision-feedback equalizer (MMSE-GDFE). This result settles the open problem posed by Zheng and Tse on the construction of explicit coding and decoding schemes that achieve the optimal diversity-multiplexing tradeoff. Moreover, our results shed more light on the structure of optimal coding/decoding techniques in delay-limited MIMO channels, and hence, open the door for novel approaches for space-time code constructions. In particular, 1) we show that MMSE-GDFE plays a fundamental role in approaching the limits of delay-limited MIMO channels in the high signal-to-noise ratio (SNR) regime, unlike the additive white Gaussian noise (AWGN) channel case and 2) our random coding arguments represent a major departure from traditional space-time code designs based on the rank and/or mutual information design criteria.     

A simple Cooperative diversity method based on network path selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this "best" relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems.     

Tradeoff Analysis of Performance and Complexity on GSECps Diversity Combining Scheme

Generalized switch and examine combining (GSEC) was recently proposed as a low-complexity diversity combining scheme for diversity-rich environment. In this paper, we present and analyze a modified version of GSEC scheme, termed as GSEC with post-examine selection (GSECps). The GSECps scheme operates in the same way as GSEC when channel conditions are favorable and becomes equivalent to the generalized selection combining (GSC) scheme otherwise. We show, through a thorough and accurate tradeoff analysis of performance versus complexity, that GSECps can deliver a better performance-complexity tradeoff than both GSEC and GSC schemes.     

网络-信道联合编码的DmF协作通信技术

提出了一种采用网络-信道编码的解调前传(DmF)协作通信方案.与译码前传(DF)相比,DmF协作方式在中继处只对信号进行解调而非译码,因此,大大降低了中继节点的复杂度.在由两个用户、一个中继节点和一个基站组成的通信模型中,采用LDPC信道编码与网络编码结合的方式,构造了一种DmF协作传输方式.在基站处,通过构造的H矩阵对来自两用户及中继的信号进行联合译码.仿真结果表明:所给方案的性能优于非协作方式及无网络编码的协作通信方式,随着信噪比的增加这种优势会更加明显;另外,DmF的性能与DF的非常接近,但其设备复杂度却大大降低,因此DmF比DF方式更具实用性.同时,该方案在降低设备复杂度、减少延迟、有效对抗无线信道慢衰落、提高通信性能及频谱利用率等方面都是非常有效的.     

Diversity–Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency-flat-fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise ratio (SNR) when properly selected baseband waveforms are employed.     

A unified framework for tree search decoding: rediscovering the sequential decoder

We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm is decomposed into the preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. We argue that the forward and feedback (matrix) filters of the minimum mean-square error decision feedback equalizer (MMSE-DFE) are instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for solving underdetermined linear systems and using lattice reduction methods to diminish complexity, at the expense of a marginal performance loss. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well-known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.     

Performance analysis of stack decoding on block coded modulation schemes using tree diagram

The channel encoder adds redundancy in a structured way to provide error control capability. Modulator converts the symbol sequences from the channel encoder into waveforms which are then transmitted over the channel. Usually channel coder and modulator are implemented independently one after the other. But in a band limited channel better coding gains without sacrificing signal power are achieved when coding is combined with modulation. Block Coded Modulation (BCM) is such a scheme that results from the combination of linear block codes and modulation. In this paper we are proposing a stack decoding of rate 2/3 and rate 1/2 BCM schemes using tree structure and performance is compared with the Viterbi decoding that uses trellis representation. Simulation result shows that at reasonable bit error rate stack decoder performance is just 0.2 to 0.5 dB inferior to that of Viterbi decoding. Since stack decoding is a near optimum decoding scheme and whose decoding procedure is adaptable to noise level, we can consider this method in place of Viterbi decoding which is optimum and its decoding complexity grows exponentially with large code lengths.     

A two‐way relay framework based on interference cancellation in wireless networks

The two‐way relay (TWR) protocols are efficient in providing appreciable throughput gains in wireless networks through the use of network coding to combine packets from multiple channels. The key determinant factor in driving the throughput improvement is the degree of simultaneity achieved in the relay scheme. In this paper, we propose a new TWR protocol named interference cancellation TWR (IC‐TWR), which combines network coding, spatial diversity, and IC techniques to arrive at high degree of simultaneity and in the meanwhile to relax the requirement on channel state information as compared with TWR schemes based on amplify‐and‐forward. Numerical analysis shows that the proposed IC‐TWR is uniformly advantageous over the traditional decode‐and‐forward scheme in terms of system throughput and end‐to‐end delay. The proposed scheme may be useful for system designers of high‐speed multimedia applications in wireless mobile networks, wireless cellular networks, wireless sensor networks, and so on. Copyright © 2015 John Wiley & Sons, Ltd.     

Exploit Network Coding Over GF(2 q ) for Multi-user Cooperative Wireless Networks

In this paper, we present a decode-and-forward network coded (DFNC) scheme over GF(2 ^q ) for the multi-user cooperative communication systems. In particular, we consider a cooperative network with m users transmitting independent packets to the same destination. These users form a cooperation set to help each other by using linear network coding. We propose a coding coefficients construction method which can efficiently reduce the transmission overhead from m(q + log₂ m) to m bits compared with conventional random network coding. Furthermore, we propose a novel decoding algorithm—credit-based updating algorithm in order to improve the solvability of decoding set of equations at the destination. The proposed decoding algorithm is combined with channel decoding and is applied on symbol-level. It can fully make use of the error recovery property of network coding while conventional decoding algorithms (e.g., Gaussian elimination) overlook it. We theoretically analyze the diversity performance in terms of information outage probability, and the results show that diversity order of m + 1 can be achieved for a m-user cooperation system. Moreover, we conduct extensive simulations to show that DFNC outperforms other transmission schemes in terms of symbol error rate and achieves higher diversity order. We also demonstrate that the proposed decoding algorithm provides significant performance gain over conventional decoding algorithm.     

Lattice Reduction Aided Detector for MIMO Communication Via Ant Colony Optimisation

In this work heuristic ant colony optimisation (ACO) procedure is deployed in conjunction with lattice reduction (LR) technique aiming to improve the performance-complexity tradeoff of detection schemes in MIMO communication. A hybrid LR-ACO MIMO detector using the linear minimum mean squared error (MMSE) criterion as initial guess is proposed and compared with two other traditional (non)linear MIMO detectors, as well as with heuristic MIMO detection approaches from the literature, in terms of both performance and complexity metrics. Numerical results show that the proposed LR-ACO outperforms the traditional ACO-based MIMO detectors and the ACO detector with the MMSE solution as initial guess, with a significant complexity reduction while is able to reach full diversity degree in all scenarios considered, including different channel correlation levels, modulation orders, and antennas configuration.     

Coding schemes for chip-to-chip interconnect applications

Increasing demand for high-speed interchip interconnects requires faster links that consume less power. The Shannon limit for the capacity of these links is at least an order of magnitude higher than the data rate of the current state-of-the-art designs. Channel coding can be used to approach the theoretical Shannon limit. Although there are numerous capacity-approaching codes in the literature, the complexity of these codes prohibits their use in high-speed interchip applications. This work studies several suitable coding schemes for chip-to-chip communication and backplane application. These coding schemes achieve 3-dB coding gain in the case of an additive white Gaussian noise (AWGN) model for the channel. In addition, a more realistic model for the channel is developed here that takes into account the effect of crosstalk, jitter, reflection, inter-symbol interference (ISI), and AWGN. Interestingly, the proposed signaling schemes are significantly less sensitive to such interference. Simulation results show coding gains of 5-8 dB for these methods with three typical channel models. In addition, low-complexity decoding architectures for implementation of these schemes are presented. Finally, circuit simulation results confirm that the high-speed implementations of these methods are feasible.