1,149 research outputs found
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
Multi-Antenna Assisted Virtual Full-Duplex Relaying with Reliability-Aware Iterative Decoding
In this paper, a multi-antenna assisted virtual full-duplex (FD) relaying
with reliability-aware iterative decoding at destination node is proposed to
improve system spectral efficiency and reliability. This scheme enables two
half-duplex relay nodes, mimicked as FD relaying, to alternatively serve as
transmitter and receiver to relay their decoded data signals regardless the
decoding errors, meanwhile, cancel the inter-relay interference with
QR-decomposition. Then, by deploying the reliability-aware iterative
detection/decoding process, destination node can efficiently mitigate
inter-frame interference and error propagation effect at the same time.
Simulation results show that, without extra cost of time delay and signalling
overhead, our proposed scheme outperforms the conventional selective
decode-and-forward (S-DF) relaying schemes, such as cyclic redundancy check
based S-DF relaying and threshold based S-DF relaying, by up to 8 dB in terms
of bit-error-rate.Comment: 6 pages, 4 figures, conference paper has been submitte
Energy-Efficient Cooperative Cognitive Relaying Schemes for Cognitive Radio Networks
We investigate a cognitive radio network in which a primary user (PU) may
cooperate with a cognitive radio user (i.e., a secondary user (SU)) for
transmissions of its data packets. The PU is assumed to be a buffered node
operating in a time-slotted fashion where the time is partitioned into
equal-length slots. We develop two schemes which involve cooperation between
primary and secondary users. To satisfy certain quality of service (QoS)
requirements, users share time slot duration and channel frequency bandwidth.
Moreover, the SU may leverage the primary feedback message to further increase
both its data rate and satisfy the PU QoS requirements. The proposed
cooperative schemes are designed such that the SU data rate is maximized under
the constraint that the PU average queueing delay is maintained less than the
average queueing delay in case of non-cooperative PU. In addition, the proposed
schemes guarantee the stability of the PU queue and maintain the average energy
emitted by the SU below a certain value. The proposed schemes also provide more
robust and potentially continuous service for SUs compared to the conventional
practice in cognitive networks where SUs transmit in the spectrum holes and
silence sessions of the PUs. We include primary source burstiness, sensing
errors, and feedback decoding errors to the analysis of our proposed
cooperative schemes. The optimization problems are solved offline and require a
simple 2-dimensional grid-based search over the optimization variables.
Numerical results show the beneficial gains of the cooperative schemes in terms
of SU data rate and PU throughput, average PU queueing delay, and average PU
energy savings
Adaptive relay techniques for OFDM-based cooperative communication systems
Cooperative communication has been considered as a cost-effective manner to exploit the spatial diversity, improve the quality-of-service and extend transmission coverage. However, there are many challenges faced by cooperative systems which use relays to forward signals to the destination, such as the accumulation of multipath channels, complex resource allocation with the bidirectional asymmetric traffic and reduction of transmission efficiency caused by additional relay overhead. In this thesis, we aim to address the above challenges of cooperative communications, and design the efficient relay systems.
Starting with the channel accumulation problem in the amplify-and-forward relay system, we proposed two adaptive schemes for single/multiple-relay networks respectively. These schemes exploit an adaptive guard interval (GI) technique to cover the accumulated delay spread and enhance the transmission efficiency by limiting the overhead. The proposed GI scheme can be implemented without any extra control signal. Extending the adaptive GI scheme to multiple-relay systems, we propose a relay selection strategy which achieves the trade-off between the transmission reliability and overhead by considering both the channel gain and the accumulated delay spread. We then consider resource allocation problem in the two-way decode-and-forward relay system with asymmetric traffic loads. Two allocation algorithms are respectively investigated for time-division and frequency-division relay systems to maximize the end-to-end capacity of the two-way system under a capacity ratio constraint. For the frequency-division systems, a balanced end-to-end capacity is defined as the objective function which combines the requirements of maximizing the end-to-end capacity and achieving the capacity ratio. A suboptimal algorithm is proposed for the frequency-division systems which separates subcarrier allocation and time/power allocation. It can achieve the similar performance with the optimal one with reduced complexity. In order to further enhance the transmission reliability and maintaining low processing delay, we propose an equalize-and-forward (EF) relay scheme. The EF relay equalizes the channel between source and relay to eliminate the channel accumulation without signal regeneration. To reduce the processing time, an efficient parallel structure is applied in the EF relay. Numerical results show that the EF relay exhibits low outage probability at the same data rate as compared to AF and DF schemes
- …