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

Differential Distributed Space-Time Coding with Imperfect Synchronization

Differential distributed space-time coding (D-DSTC) has been considered to improve both diversity and data-rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are perfectly synchronized in the symbol level. In practice, this assumption is easily violated due to the distributed nature of the relay networks. This paper proposes a new differential encoding and decoding process for D-DSTC systems with two relays. The proposed method is robust against synchronization errors and does not require any channel information at the destination. Moreover, the maximum possible diversity and symbol-by-symbol decoding are attained. Simulation results are provided to show the performance of the proposed method for various synchronization errors and the fact that our algorithm is not sensitive to synchronization error.Comment: to appear in IEEE Globecom, 201

Multiple-Resampling Receiver Design for OFDM Over Doppler-Distorted Underwater Acoustic Channels

Cataloged from PDF version of article.In this paper, we focus on orthogonal frequency-divisionmultiplexing (OFDM) receiver designs for underwater acoustic (UWA) channels with user- and/or path-specific Doppler scaling distortions. The scenario is motivated by the cooperative communications framework, where distributed transmitter/receiver pairs may experience significantly different Doppler distortions, as well as by the single-user scenarios, where distinct Doppler scaling factors may exist among different propagation paths. The conventional approach of front–end resampling that corrects for common Doppler scalingmay not be appropriatein such scenarios, rendering a post-fast-Fourier-transform (FFT) signal that is contaminated by user- and/or path-specific intercarrier interference. To counteract this problem, we propose a family of front–end receiver structures thatutilizemultiple-resampling (MR)branches,eachmatched to the Doppler scaling factor of a particular user and/or path. Following resampling, FFT modules transform the Doppler-compensated signals into the frequency domain for further processing through linear or nonlinear detection schemes. As part of the overall receiver structure, a gradient–descent approachis also proposed to refine the channel estimates obtained by standard sparse channel estimators. The effectiveness and robustness of the proposed receivers are demonstrated via simulations, as well as emulations based on real data collected during the 2010 Mobile Acoustic Communications Experiment (MACE10, Martha’s Vineyard, MA) and the 2008 Kauai Acomms MURI (KAM08, Kauai, HI) experiment

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

Resource allocation and optimization techniques in wireless relay networks

Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks

On rate capacity and signature sequence adaptation in downlink of MC-CDMA system

This dissertation addresses two topics in the MC-CDMA system: rate capacity and adaptation of users\u27 signature sequences. Both of them are studied for the downlink communication scenario with multi-code scheme. The purpose of studying rate capacity is to understand the potential of applying MC-CDMA technique for high speed wireless data communications. It is shown that, to maintain high speed data transmission with multi-code scheme, each mobile should cooperatively decode its desired user\u27s encoded data symbols which are spread with different signature sequences simultaneously. Higher data rate can be achieved by implementing dirty paper coding (DPC) to cooperatively encode all users\u27 data symbols at the base station. However, the complexity of realizing DPC is prohibitively high. Moreover, it is found that the resource allocation policy has profound impact on the rate capacity that can be maintained in the system. Nevertheless, the widely adopted proportional resource allocation policy is only suitable for the communication scenario in which the disparity of users\u27 channel qualities is small. When the difference between users\u27 channel qualities is large, one must resort to non-proportional assignment of power and signature sequences. Both centralized and distributed schemes are proposed to adapt users\u27 signature sequences in the downlink of MC-CDMA system. With the former, the base station collects complete channel state information and iteratively adapts all users\u27 signature sequences to optimize an overall system performance objective function, e.g. the weighted total mean square error (WTMSE). Since the proposed centralized scheme is designed such that each iteration of signature sequence adaptation decreases the WTMSE which is lower bounded, the convergence of the proposed centralized scheme is guaranteed. With the distributed signature sequence adaptation, each user\u27s signature sequences are independently adapted to optimize the associated user\u27s individual performance objective function with no regard to the performance of other users in the system. Two distributed adaptation schemes are developed. In one scheme, each user adapts its signature sequences under a pre-assigned power constraint which remains unchanged during the process of adaptation. In the other scheme, pricing methodology is applied so that the transmission power at the base station is properly distributed among users when users\u27 signature sequences are adapted. The stability issue of these distributed adaptation schemes is analyzed using game theory frame work. It is proven that there always exists a set of signature sequences at which no user can unilaterally adapt its signature sequences to further improve its individual performance, given the signature sequences chosen by other users in the system