165 research outputs found
Interleaving Gains for Receive Diversity Schemes of Distributed Turbo Codes in Wireless Half–Duplex Relay Channels
This paper proposes the interleaving gain in two different distributed turbo-coding schemes: Distributed Turbo Codes (DTC) and Distributed Multiple Turbo Codes (DMTC) for half-duplex relay system as an extension of our previous work on turbo coding interleaver design for direct communication channel. For these schemes with half-duplex constraint, the source node transmits its information with the parity bit sequence(s) to both the relay and the destination nodes during the first phase. The relay received the data from the source and process it by using decode and forward protocol. For the second transmission period, the decoded systematic data at relay is interleaved and re-encoded by a Recursive Systematic Convolutional (RSC) encoder and forwarded to the destination. At destination node, the signals received from the source and relay are processed by using turbo log-MAP iterative decoding for retrieving the original information bits. We demonstrate via simulations that the interleaving gain has a large effect with DTC scheme when we use only one RSC encoder at both the source and relay with best performance when using Modified Matched S-Random (MMSR) interleaver. Furthermore, by designing a Chaotic Pseudo Random Interleaver (CPRI) as an outer interleaver at the source node instead of classical interleavers, our scheme can add more secure channel conditions
Cooperative diversity techniques for future wireless communications systems.
Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2013.Multiple-input multiple-output (MIMO) systems have been extensively studied in the past
decade. The attractiveness of MIMO systems is due to the fact that they drastically reduce
the deleterious e ects of multipath fading leading to high system capacity and low error rates.
In situations where wireless devices are restrained by their size and hardware complexity, such
as mobile phones, transmit diversity is not achievable. A new paradigm called cooperative
communication is a viable solution. In a cooperative scenario, a single-antenna device is
assisted by another single-antenna device to relay its message to the destination or base
station. This creates a virtual multiple-input multiple-output (MIMO) system.
There exist two cooperative strategies: amplify-and-forward (AF) and decode-and-forward
(DF). In the former, the relay ampli es the noisy signal received from the source before forwarding
it to the destination. No form of demodulation is required. In the latter, the relay
rst decodes the source signal before transmitting an estimate to the destination. In this
work, focus is on the DF method. A drawback of an uncoded DF cooperative strategy is
error propagation at the relay. To avoid error propagation in DF, various relay selection
schemes can be used. Coded cooperation can also be used to avoid error propagation at
the relay. Various error correcting codes such as convolutional codes or turbo codes can
be used in a cooperative scenario. The rst part of this work studies a variation of the
turbo codes in cooperative diversity, that further reduces error propagation at the relay,
hence lowering the end-to-end error rate. The union bounds on the bit-error rate (BER) of
the proposed scheme are derived using the pairwise error probability via the transfer bounds
and limit-before-average techniques. In addition, the outage analysis of the proposed scheme
is presented. Simulation results of the bit error and outage probabilities are presented to
corroborate the analytical work. In the case of outage probability, the computer simulation
results are in good agreement with the the analytical framework presented in this chapter.
Recently, most studies have focused on cross-layer design of cooperative diversity at the
physical layer and truncated automatic-repeat request (ARQ) at the data-link layer using the
system throughput as the performance metric. Various throughput optimization strategies
have been investigated. In this work, a cross-relay selection approach that maximizes the
system throughput is presented. The cooperative network is comprised of a set of relays and
the reliable relay(s) that maximize the throughput at the data-link layer are selected to assist
the source. It can be shown through simulation that this novel scheme outperforms from
a throughput point of view, a system throughput where the all the reliable relays always
participate in forwarding the source packet.
A power optimization of the best relay uncoded DF cooperative diversity is investigated.
This optimization aims at maximizing the system throughput. Because of the non-concavity
and non-convexity of the throughput expression, it is intractable to derive a closed-form
expression of the optimal power through the system throughput. However, this can be done
via the symbol-error rate (SER) optimization, since it is shown that minimizing the SER of
the cooperative system is equivalent to maximizing the system throughput. The SER of the
retransmission scheme at high signal-to-noise ratio (SNR) was obtained and it was noted that
the derived SER is in perfect agreement with the simulated SER at high SNR. Moreover, the
optimal power allocation obtained under a general optimization problem, yields a throughput
performance that is superior to non-optimized power values from moderate to high SNRs.
The last part of the work considers the throughput maximization of the multi-relay adaptive
DF over independent and non-identically distributed (i.n.i.d.) Rayleigh fading channels,
that integrates ARQ at the link layer. The aim of this chapter is to maximize the system
throughput via power optimization and it is shown that this can be done by minimizing the
SER of the retransmission. Firstly, the closed-form expressions for the exact SER of the
multi-relay adaptive DF are derived as well as their corresponding asymptotic bounds. Results
showed that the optimal power distribution yields maximum throughput. Furthermore,
the power allocated at a relay is greatly dependent of its location relative to the source and
destination
Self-concatenated coding for wireless communication systems
In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput
Selective Combining for Hybrid Cooperative Networks
In this study, we consider the selective combining in hybrid cooperative
networks (SCHCNs scheme) with one source node, one destination node and
relay nodes. In the SCHCN scheme, each relay first adaptively chooses between
amplify-and-forward protocol and decode-and-forward protocol on a per frame
basis by examining the error-detecting code result, and () relays will be selected to forward their received signals to the
destination. We first develop a signal-to-noise ratio (SNR) threshold-based
frame error rate (FER) approximation model. Then, the theoretical FER
expressions for the SCHCN scheme are derived by utilizing the proposed SNR
threshold-based FER approximation model. The analytical FER expressions are
validated through simulation results.Comment: 27 pages, 8 figures, IET Communications, 201
Distributed Space-Time Message Relaying for Uncoded/Coded Wireless Cooperative Communications
During wireless communications, nodes can overhear other transmissions through the wireless medium, suggested by the broadcast nature of plane wave propagation, and may help to provide extra observations of the source signals to the destination. Modern research in wireless communications pays more attention to these extra observations which were formerly neglected within networks. Cooperative communication processes this abundant information existing at the surrounding nodes and retransmits towards the destination in various forms to create spatial and/or coding diversity, thereby to obtain higher throughput and reliability. The aim of this work is to design cooperative communication systems with distributed space-time block codes (DSTBC) in different relaying protocols and theoretically derive the BER performance for each scenario. The amplify-and-forward (AF) protocol is one of the most commonly used protocols at the relays. It has a low implementation complexity but with a drawback of amplifying the noise as well. We establish the derivation of the exact one-integral expression of the average BER performance of this system, folloby a novel approximation method based on the series expansion. An emerging technology, soft decode-and-forward (SDF), has been presented to combine the desired features of AF and DF: soft signal representation in AF and channel coding gain in DF. In the SDF protocol, after decoding, relays transmit the soft-information, which represents the reliability of symbols passed by the decoder, to the destination. Instead of keeping the source node idling when the relays transmit as in the traditional SDF system, we let the source transmit hard information and cooperate with the relays using DSTBC. By theoretically deriving the detection performance at the destination by either using or not using the DSTBC, we make comparisons among three SDF systems. Interesting results have been shown, together with Monte-Carlo simulations, to illustrate that our proposed one-relay and two-relay SDF & DSTBC systems outperform traditional soft relaying for most of the cases. Finally, these analytic results also provide a way to implement the optimal power allocation between the source and the relay or between relays, which is illustrated in the line model
Distributed Self-Concatenated Coding for Cooperative Communication
In this paper, we propose a power-efficient distributed binary self-concatenated coding scheme using iterative decoding (DSECCC-ID) for cooperative communications. The DSECCC-ID scheme is designed with the aid of binary extrinsic information transfer (EXIT) charts. The source node transmits self-concatenated convolutional coded (SECCC) symbols to both the relay and destination nodes during the first transmission period. The relay performs SECCC-ID decoding, where it mayor may not encounter decoding errors. It then reencodes the information bits using a recursive systematic convolutional (RSC) code during the second transmission period. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel concatenated encoder. At the destination node, three-component DSECCC-ID decoding is performed. The EXIT chart gives us an insight into operation of the distributed coding scheme, which enables us to significantly reduce the transmit power by about 3.3 dB in signal-to-noise ratio (SNR) terms, as compared with a noncooperative SECCC-ID scheme at a bit error rate (BER) of 10-5. Finally, the proposed system is capable of performing within about 1.5 dB from the two-hop relay-aided network’s capacity at a BER of 10-5 , even if there may be decoding errors at the relay
- …