1,072 research outputs found

    Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

    Full text link
    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

    DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models

    Full text link
    The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code applied. As a special case, it is established that the LLL-based LR-aided linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal decoding of any lattice code at a worst-case complexity that grows at most linearly in the data rate. This represents a fundamental reduction in the decoding complexity when compared to ML decoding whose complexity is generally exponential in rate. The results' generality lends them applicable to a plethora of pertinent communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI, cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality of the LR-aided linear decoder is guaranteed. The adopted approach yields insight, and motivates further study, into joint transceiver designs with an improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions on Information Theor

    Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems with Co-Channel Interference

    Full text link
    In this paper, efficient turbo packet combining for single carrier (SC) broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat request (ARQ) transmission with unknown co-channel interference (CCI) is studied. We propose a new frequency domain soft minimum mean square error (MMSE)-based signal level combining technique where received signals and channel frequency responses (CFR)s corresponding to all retransmissions are used to decode the data packet. We provide a recursive implementation algorithm for the introduced scheme, and show that both its computational complexity and memory requirements are quite insensitive to the ARQ delay, i.e., maximum number of ARQ rounds. Furthermore, we analyze the asymptotic performance, and show that under a sum-rank condition on the CCI MIMO ARQ channel, the proposed packet combining scheme is not interference-limited. Simulation results are provided to demonstrate the gains offered by the proposed technique.Comment: 12 pages, 7 figures, and 2 table

    Space-Time-Frequency Shift Keying for Dispersive Channels

    No full text
    Inspired by the concept of the Space-Time Shift Keying (STSK) modulation, in this paper we proposed the Space-Frequency Shift Keying (SFSK) modulation as well as the Space-Time-Frequency Shift Keying (STFSK) concept which spreads the transmit signal not only across the space and time domains, but also the frequency domain. The performance of STSK modulation is degraded by about 2 dB, when the channel changes from uncorrelated frequency-flat fading to the frequency-selective environment of the 6-tap COST207 model. By contrast, as a benefit of Frequency Shift keying, the SFSK and STFSK schemes are capable of maintaining their performance also in frequency-selective fading environments. Finally, we demonstrate that the STSK and SFSK schemes constitute special cases of the STFSK modulatio

    Multipath Multiplexing for Capacity Enhancement in SIMO Wireless Systems

    Full text link
    This paper proposes a novel and simple orthogonal faster than Nyquist (OFTN) data transmission and detection approach for a single input multiple output (SIMO) system. It is assumed that the signal having a bandwidth BB is transmitted through a wireless channel with LL multipath components. Under this assumption, the current paper provides a novel and simple OFTN transmission and symbol-by-symbol detection approach that exploits the multiplexing gain obtained by the multipath characteristic of wideband wireless channels. It is shown that the proposed design can achieve a higher transmission rate than the existing one (i.e., orthogonal frequency division multiplexing (OFDM)). Furthermore, the achievable rate gap between the proposed approach and that of the OFDM increases as the number of receiver antennas increases for a fixed value of LL. This implies that the performance gain of the proposed approach can be very significant for a large-scale multi-antenna wireless system. The superiority of the proposed approach is shown theoretically and confirmed via numerical simulations. {Specifically, we have found {upper-bound average} rates of 15 bps/Hz and 28 bps/Hz with the OFDM and proposed approaches, respectively, in a Rayleigh fading channel with 32 receive antennas and signal to noise ratio (SNR) of 15.3 dB. The extension of the proposed approach for different system setups and associated research problems is also discussed.Comment: IEEE Transactions on Wireless Communication

    Embedded Rank Distance Codes for ISI channels

    Get PDF
    Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.Comment: Submitted to IEEE Transactions on Information Theor

    A universal space-time architecture for multiple-antenna aided systems

    No full text
    In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements
    corecore