195 research outputs found

    MC-CDMA aided multi-user space-time shift keying in wideband channels

    No full text
    In this paper, we propose multi-carrier code division multiple access (MC-CDMA)-aided space-time shift keying (STSK) for mitigating the performance erosion of the classic STSK scheme in dispersive channels, while supporting multiple users. The codewords generated by the STSK scheme are appropriately spread in frequency-domain (FD) and transmitted over a number of parallel frequency-?at subchannels. We propose a new receiver architecture amalgamating the single-stream maximum-likelihood (ML) detector of the STSK system and the multiuser detector (MUD) of the MC-CDMA system. The performance of the proposed scheme is evaluated for transmission over frequency-selective channels in both uncoded and channel-coded scenarios. The results of our simulations demonstrate that the proposed scheme overcomes the channel impairments imposed by wideband channels and exhibits near-capacity performance in a channel-coded scenario

    Layered Steered Space–Time-Spreading-Aided Generalized MC DS-CDMA

    No full text
    Abstract—We present a novel trifunctional multiple-input– multiple-output (MIMO) scheme that intrinsically amalgamates space–time spreading (STS) to achieve a diversity gain and a Vertical Bell Labs layered space–time (V-BLAST) scheme to attain a multiplexing gain in the context of generalized multicarrier direct-sequence code-division multiple access (MC DS-CDMA), as well as beamforming. Furthermore, the proposed system employs both time- and frequency-domain spreading to increase the number of users, which is also combined with a user-grouping technique to reduce the effects of multiuser interference

    Synchronization in Cooperative Communication Systems

    No full text
    Cooperative communication is an attractive solution to combat fading in wireless communication systems. Achieving synchronization is a fundamental requirement in such systems. In cooperative networks, multiple single antenna relay terminals receive and cooperatively transmit the source information to the destination. The multiple distributed nodes, each with its own local oscillator, give rise to multiple timing offsets (MTOs) and multiple carrier frequency offsets (MCFOs). Particularly, the received signal at the destination is the superposition of the relays' transmitted signals that are attenuated differently, are no longer aligned with each other in time, and experience phase rotations at different rates due to different channels, MTOs, and MCFOs, respectively. The loss of synchronization due to the presence of MTOs and MCFOs sets up the recovery of the source signal at the destination to be a very challenging task. This thesis seeks to develop estimation and compensation algorithms that can achieve synchronization and enable cooperative communication for both decode-and-forward (DF) and amplify-and-forward (AF) relaying networks in the presence of multiple impairments, i.e., unknown channel gains, MTOs, and MCFOs. In the first part of the thesis, a training-based transmission scheme is considered, in which training symbols are transmitted first in order to assist the joint estimation of multiple impairments at the destination node in DF and AF cooperative relaying networks. New transceiver structure at the relays and novel receiver design at the destination are proposed which allow for the decoding of the received signal in the presence of unknown channel gains, MTOs, and MCFOs. Different estimation algorithms, e.g., least squares (LS), expectation conditional maximization (ECM), space-alternating generalized expectation-maximization (SAGE), and differential evolution (DE), are proposed and analyzed for joint estimation of multiple impairments. In order to compare the estimation accuracy of the proposed estimators, Cramer-Rao lower bounds (CRLBs) for the multi-parameter estimation are derived. Next, in order to detect the signal from multiple relays in the presence of multiple impairments, novel optimal and sub-optimal minimum mean-square error (MMSE) compensation and maximum likelihood (ML) decoding algorithm are proposed for the destination receiver. It has been evidenced by numerical simulations that application of the proposed estimation and compensation methods in conjunction with space-time block codes achieve full diversity gain in the presence of channel and synchronization impairments. Considering training-based transmission scheme, this thesis also addresses the design of optimal training sequences for efficient and joint estimation of MTOs and multiple channel parameters. In the second part of the thesis, the problem of joint estimation and compensation of multiple impairments in non-data-aided (NDA) DF cooperative systems is addressed. The use of blind source separation is proposed at the destination to convert the difficult problem of jointly estimating the multiple synchronization parameters in the relaying phase into more tractable sub-problems of estimating many individual timing offsets and carrier frequency offsets for the independent relays. Next, a criteria for best relay selection is proposed at the destination. Applying the relay selection algorithm, simulation results demonstrate promising bit-error rate (BER) performance and realise the achievable maximum diversity order at the destination

    Coherent and Differential Downlink Space-Time Steering Aided Generalised Multicarrier DS-CDMA

    No full text
    This paper presents a generalised MultiCarrier Direct Sequence Code Division Multiple Access (MC DS-CDMA) system invoking smart antennas for improving the achievable performance in the downlink. In this contribution, the MC DSCDMA transmitter employs an Antenna Array (AA) and Steered Space-Time Spreading (SSTS). Furthermore, the proposed system employs both Time and Frequency (TF) domain spreading for extending the capacity of the system, which is combined with a user-grouping technique for reducing the effects of Multi-User Interference (MUI). Moreover, to eliminate the high complexity Multiple Input Multiple Output (MIMO) channel estimation required for coherent detection, we also propose a Differential SSTS (DSSTS) scheme. More explicitly, for coherent SSTS detection MVNr number of channel estimates have to be generated, where M is the number of transmit AAs, V is the number of subcarriers and Nr is the number of receive antennas. This is a challenging task, which renders the low-complexity DSSTS scheme attractive. Index Terms—MIMO, MC DS-CDMA, beamforming, spacetime spreading, differential space-time spreading

    Performance of the Smart Antenna Aided Generalized Multicarrier DS-CDMA Downlink using both Time-Domain Spreading and Steered Space-Time Spreading

    No full text
    In this contribution a generalized MC DS-CDMA system invoking smart antennas for improving the achievable performance in the downlink of the system is studied, which is capable of minimizing the downlink interference inflicted upon co-channel mobiles, while achieving frequency, time and spatial diversity. In the MC DS-CDMA system considered the transmitter employs multiple antenna arrays and each of the antenna arrays consists of several antenna elements. More specifically, the space-time transmitter processing scheme considered is based on the principles of Steered Space-Time Spreading (SSTS). Furthermore, the generalized MC DS-CDMA system employs time and frequency (TF)-domain spreading, where a user-grouping technique is employed for reducing the effects of multiuser interference

    Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design

    No full text
    The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function’s evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD’s computational complexity is significantly lower
    corecore