398 research outputs found

    Differential space time modulation and demodulation for time varying multiple input multiple output channels

    Get PDF
    Over the last decade there has been considerable interest in wireless communication using multiple transmit and receive antennas. Several literatures exists that show that these multiple link support very high data rates with low error probabilities when the channel state information is available at the receiver. However when multiple antennas are employed or when the mobile environments change rapidly, it is not always possible to have apriori knowledge of the channel state matrices which calls for Differential Space-Time modulation techniques. Differential modulation is used in conjunction with Unitary Space-Time codes to evaluate their performance over time varying channels. Jakes model for frequency flat fading processes in mobile radio systems is incorporated with the differential modulation scheme to model a time-varying space-time Rayleigh fading multiple input multiple output (MIMO) radio channel. Parametric unitary codes that are known to have the largest possible diversity product for a 16-signal constellation and a 4-signal constellation with both optimal diversity sum and diversity product is used to evaluate the Block Error Rates for 2 and 5 receiver antennas that are moving at different velocities. A fast differential demodulation for Alamouti codes is derived based on prior work by Liang and Xia and is tested using our simulations. MATLAB R2006b V 7.1 is used to simulate the performance of M=2, N=2 and M=2 N=5 antennas over a time varying channel for velocities of 0, 50, 75, 100 and 125 kmph. We also show that the fast demodulation algorithm is almost twice as fast and also perform within 1dB of existing differential demodulation schemes

    Single-RF spatial modulation requires single-carrier transmission: frequency-domain turbo equalization for dispersive channels

    No full text
    In this paper, we propose a broadband single-carrier (SC) spatial-modulation (SM) based multiple-input multipleoutput (MIMO) architecture relying on a soft-decision (SoD) frequency-domain equalization (FDE) receiver. We demonstrate that conventional orthogonal frequency-division multiplexing (OFDM)-based broadband transmissions are not readily suitable for the single–radio frequency (RF) assisted SM-MIMO schemes, since this scheme does not exhibit any substantial performance advantage over single-antenna transmissions. To circumvent this limitation, a low-complexity soft-decision (SoD) FDE algorithm based on the minimum mean-square error (MMSE) criterion is invoked for our broadband SC-based SM-MIMO scheme, which is capable of operating in a strongly dispersive channel having a long channel impulse response (CIR) at a moderate decoding complexity. Furthermore, our SoD FDE attains a near-capacity performance with the aid of a three-stage concatenated SC-based SM architecture

    Adaptive multiple symbol decision feedback for non-coherent detection.

    Get PDF
    Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2006.Non-coherent detection is a simple form of signal detection and demodulation for digital communications. The main drawback of this detection method is the performance penalty incurred, since the channel state information is not known at the receiver. Multiple symbol detection (MSD) is a technique employed to close the gap between coherent and non-coherent detection schemes. Differentially encoded JW-ary phase shift keying (DM-PSK) is the classic modulation technique that is favourable for non-coherent detection. The main drawback for standard differential detection (SDD) has been the error floor incurred for frequency flat fading channels. Recently a decision feedback differential detection (DFDD) scheme, which uses the concept of MSD was proposed and offered significant performance gain over the SDD in the mobile flat fading channel, almost eliminating the error floor. This dissertation investigates multiple symbol decision feedback detection schemes, and proposes alternate adaptive strategies for non-coherent detection. An adaptive algorithm utilizing the numerically stable QR decomposition that does not require training symbols is proposed, named QR-DFDD. The QR-DFDD is modified to use a simpler QR decomposition method which incorporates sliding windows: QRSW-DFDD. This structure offers good tracking performance in flat fading conditions, while achieving near optimal DFDD performance. A bit interleaved coded decision feedback differential demodulation (DFDM) scheme, which takes advantage of the decision feedback concept and iterative decoding, was introduced by Lampe in 2001. This low complexity iterative demodulator relied on accurate channel statistics for optimal performance. In this dissertation an alternate adaptive DFDM is introduced using the recursive least squares (RLS) algorithm. The alternate iterative decoding procedure makes use of the convergence properties of the RLS algorithm that is more stable and achieves superior performance compared to the DFDM

    On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels

    Get PDF
    This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available at the transmitter. Using the maximum likelihood (ML) principle, and assuming perfect knowledge of the channel mean, we derive the optimal multiple symbol detection (MSD) rule for diagonal differential unitary space-time modulation (DUSTM). This rule is used to develop a sphere decoding bound intersection detector (SD-BID) with low complexity. A suboptimal MSD based decision feedback DD (DF-DD) algorithm is also derived. The simulation results show that our proposed MSD algorithms reduce the error floor of conventional differential detection and that the computational complexity of these new algorithms is reasonably low

    A Space Communications Study Final Report, Sep. 15, 1965 - Sep. 15, 1966

    Get PDF
    Reception of frequency modulated signals passed through deterministic and random time-varying channel

    Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)

    Get PDF
    This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICM-ID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels. For BICM-ID over a single-antenna frequency non-selective fading channel, the problem of mapping over multiple symbols, i.e., multi-dimensional (multi-D) mapping, with 8-PSK constellation is investigated. An explicit algorithm to construct a good multi-D mapping of 8-PSK to improve the asymptotic performance of BICM-ID systems is introduced. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (1-dimensional complex) mapping and the multi-D mapping found previously by computer search is thoroughly demonstrated. In addition to the mapping issue in single-antenna BICM-ID systems, the use of signal space diversity (SSD), also known as linear constellation precoding (LCP), is considered in BICM-ID over frequency non-selective fading channels. The performance analysis of BICM-ID and complex N-dimensional signal space diversity is carried out to study its performance limitation, the choice of the rotation matrix and the design of a low-complexity receiver. Based on the design criterion obtained from a tight error bound, the optimality of the rotation matrix is established. It is shown that using the class of optimal rotation matrices, the performance of BICM-ID systems over a frequency non-selective Rayleigh fading channel approaches that of the BICM-ID systems over an additive white Gaussian noise (AWGN) channel when the dimension of the signal constellation increases. Furthermore, by exploiting the sigma mapping for any M-ary quadrature amplitude modulation (QAM) constellation, a very simple sub-optimal, yet effective iterative receiver structure suitable for signal constellations with large dimensions is proposed. Simulation results in various cases and conditions indicate that the proposed receiver can achieve the analytical performance bounds with low complexity. The application of BICM-ID with SSD is then extended to the case of cascaded Rayleigh fading, which is more suitable to model mobile-to-mobile communication channels. By deriving the error bound on the asymptotic performance, it is first illustrated that for a small modulation constellation, a cascaded Rayleigh fading causes a much more severe performance degradation than a conventional Rayleigh fading. However, BICM-ID employing SSD with a sufficiently large constellation can close the performance gap between the Rayleigh and cascaded Rayleigh fading channels, and their performance can closely approach that over an AWGN channel. In the next step, the use of SSD in BICM-ID over frequency selective Rayleigh fading channels employing a multi-carrier modulation technique known as orthogonal frequency division multiplexing (OFDM) is studied. Under the assumption of correlated fading over subcarriers, a tight bound on the asymptotic error performance for the general case of applying SSD over all N subcarriers is derived and used to establish the best achievable asymptotic performance by SSD. It is then shown that precoding over subgroups of at least L subcarriers per group, where L is the number of channel taps, is sufficient to obtain this best asymptotic error performance, while significantly reducing the receiver complexity. The optimal joint subcarrier grouping and rotation matrix design is subsequently determined by solving the Vandermonde linear system. Illustrative examples show a good agreement between various analytical and simulation results. Further, by combining the ideas of multi-D mapping and subcarrier grouping, a novel power and bandwidth-efficient bit-interleaved coded modulation with OFDM and iterative decoding (BI-COFDM-ID) in which multi-D mapping is performed over a group of subcarriers for broadband transmission in a frequency selective fading environment is proposed. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multi-D mapping for BICM-ID in frequency non-selective Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with SSD. Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using SSD and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth and receiver complexity. Finally, the investigation is extended to the application of BICM-ID over a multiple-input multiple-output (MIMO) system equipped with multiple antennas at both the transmitter and the receiver to exploit both time and spatial diversities, where neither the transmitter nor the receiver knows the channel fading coefficients. The concentration is on the class of unitary constellation, due to its advantages in terms of both information-theoretic capacity and error probability. The tight error bound with respect to the asymptotic performance is also derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, by using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. Analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping

    Narrow band digital modulation for land mobile radio.

    Get PDF

    A space communication study Final report, 15 Sep. 1967 - 15 Sep. 1968

    Get PDF
    Transmitting and receiving analog and digital signals through noisy media - space communications stud
    • …
    corecore