610 research outputs found

    A Noncoherent Space-Time Code from Quantum Error Correction

    Full text link
    In this work, we develop a space-time block code for noncoherent communication using techniques from the field of quantum error correction. We decompose the multiple-input multiple-output (MIMO) channel into operators from quantum mechanics, and design a non-coherent space time code using the quantum stabilizer formalism. We derive an optimal decoder, and analyze the former through a quantum mechanical lens. We compare our approach to a comparable coherent approach and a noncoherent differential approach, achieving comparable or better performance.Comment: 6 pages, one figure, accepted at the 53rd annual Conference on Information Sciences and System

    Bound-intersection detection for multiple-symbol differential unitary space-time modulation

    Get PDF
    This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over multiple-antenna systems. We derive a novel exact maximum-likelihood (ML) detector, called the bound-intersection detector (BID), using the extended Euclidean algorithm for single-symbol detection of diagonal constellations. While the ML search complexity is exponential in the number of transmit antennas and the data rate, our algorithm, particularly in high signal-to-noise ratio, achieves significant computational savings over the naive ML algorithm and the previous detector based on lattice reduction. We also develop four BID variants for MSD. The first two are ML and use branch-and-bound, the third one is suboptimal, which first uses BID to generate a candidate subset and then exhaustively searches over the reduced space, and the last one generalizes decision-feedback differential detection. Simulation results show that the BID and its MSD variants perform nearly ML, but do so with significantly reduced complexity

    Maximum likelihood detection for differential unitary space-time modulation with carrier frequency offset

    Get PDF
    Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)? This paper answers this question affirmatively and derives the necessary maximum likelihood (ML) detection rule. The asymptotic performance of the proposed ML rule is analyzed, leading to a code design criterion for DUSTM by using the modified diversity product. The resulting proposed decision rule is a new differential modulation scheme in both the temporal and spatial domains. Two sub-optimal multiple-symbol decision rules with improved performance are also proposed. For the efficient implementation of these, we derive a modified bound intersection detector (BID), a generalization of the previously derived optimal BID for the conventional DUSTM. The simulation results show that the proposed differential modulation scheme is more robust against CFO drifting than the existing double temporal differential modulation

    Space Station communications and tracking systems modeling and RF link simulation

    Get PDF
    In this final report, the effort spent on Space Station Communications and Tracking System Modeling and RF Link Simulation is described in detail. The effort is mainly divided into three parts: frequency division multiple access (FDMA) system simulation modeling and software implementation; a study on design and evaluation of a functional computerized RF link simulation/analysis system for Space Station; and a study on design and evaluation of simulation system architecture. This report documents the results of these studies. In addition, a separate User's Manual on Space Communications Simulation System (SCSS) (Version 1) documents the software developed for the Space Station FDMA communications system simulation. The final report, SCSS user's manual, and the software located in the NASA JSC system analysis division's VAX 750 computer together serve as the deliverables from LinCom for this project effort

    Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies

    Get PDF
    The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy

    A measure preserving mapping for structured Grassmannian constellations in SIMO channels

    Get PDF
    In this paper, we propose a new structured Grassmannian constellation for noncoherent communications over single-input multiple-output (SIMO) Rayleigh block-fading channels. The constellation, which we call Grass-Lattice, is based on a measure preserving mapping from the unit hypercube to the Grassmannian of lines. The constellation structure allows for on-the-fly symbol generation, low-complexity decoding, and simple bit-to-symbol Gray coding. Simulation results show that Grass-Lattice has symbol error rate performance close to that of a numerically optimized unstructured constellation, and is more power efficient than other structured constellations proposed in the literature.This work was supported by Huawei Technologies Sweden, under the project GRASSCOM. The work of D. Cuevas was also partly supported under grant FPU20/03563 funded by Ministerio de Universidades (MIU), Spain. The work of Carlos Beltr´an was also partly supported under grant PID2020-113887GB-I00 funded by MCIN/AEI /10.13039/501100011033. The work ofI. Santamaria was also partly supported under grant PID2019-104958RB-C43(ADELE) funded by MCIN/ AEI /10.13039/501100011033

    Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry

    Get PDF
    This thesis treats the development of bandwidth-efficient serially concatenated coded (SCC) continuous phase modulation (CPM) techniques for aeronautical telemetry. The concatenated code consists of an inner and an outer code, separated by an interleaver in most configurations, and is decoded using relatively simple near-optimum iterative decoding algorithms. CPM waveforms such as shaped-offset quadrature phase shift keying (SOQPSK) and pulse code modulation/frequency modulation (PCM/FM), which are currently used in military satellite and aeronautical telemetry standards, can be viewed as inner codes due to their recursive nature. For the outer codes, this thesis applies serially concatenated convolutional codes (SCCC), turbo-product codes (TPC) and repeat-accumulate codes (RAC) because of their large coding gains, high code rates, and because their decoding algorithms are readily implemented. High-rate codes are of special interest in aeronautical telemetry applications due to recent reductions in available spectrum and ever-increasing demands on data rates. This thesis evaluates the proposed coding schemes with a large set of numerical simulation results and makes a number of recommendations based on these results
    corecore