On feedback-based rateless codes for data collection in vehicular networks

The ability to transfer data reliably and with low delay over an unreliable service is intrinsic to a number of emerging technologies, including digital video broadcasting, over-the-air software updates, public/private cloud storage, and, recently, wireless vehicular networks. In particular, modern vehicles incorporate tens of sensors to provide vital sensor information to electronic control units (ECUs). In the current architecture, vehicle sensors are connected to ECUs via physical wires, which increase the cost, weight and maintenance effort of the car, especially as the number of electronic components keeps increasing. To mitigate the issues with physical wires, wireless sensor networks (WSN) have been contemplated for replacing the current wires with wireless links, making modern cars cheaper, lighter, and more efficient. However, the ability to reliably communicate with the ECUs is complicated by the dynamic channel properties that the car experiences as it travels through areas with different radio interference patterns, such as urban versus highway driving, or even different road quality, which may physically perturb the wireless sensors. This thesis develops a suite of reliable and efficient communication schemes built upon feedback-based rateless codes, and with a target application of vehicular networks. In particular, we first investigate the feasibility of multi-hop networking for intra-car WSN, and illustrate the potential gains of using the Collection Tree Protocol (CTP), the current state of the art in multi-hop data aggregation. Our results demonstrate, for example, that the packet delivery rate of a node using a single-hop topology protocol can be below 80% in practical scenarios, whereas CTP improves reliability performance beyond 95% across all nodes while simultaneously reducing radio energy consumption. Next, in order to migrate from a wired intra-car network to a wireless system, we consider an intermediate step to deploy a hybrid communication structure, wherein wired and wireless networks coexist. Towards this goal, we design a hybrid link scheduling algorithm that guarantees reliability and robustness under harsh vehicular environments. We further enhance the hybrid link scheduler with the rateless codes such that information leakage to an eavesdropper is almost zero for finite block lengths. In addition to reliability, one key requirement for coded communication schemes is to achieve a fast decoding rate. This feature is vital in a wide spectrum of communication systems, including multimedia and streaming applications (possibly inside vehicles) with real-time playback requirements, and delay-sensitive services, where the receiver needs to recover some data symbols before the recovery of entire frame. To address this issue, we develop feedback-based rateless codes with dynamically-adjusted nonuniform symbol selection distributions. Our simulation results, backed by analysis, show that feedback information paired with a nonuniform distribution significantly improves the decoding rate compared with the state of the art algorithms. We further demonstrate that amount of feedback sent can be tuned to the specific transmission properties of a given feedback channel

Bandwidth-efficient communication systems based on finite-length low density parity check codes

Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part

Aeronautical Engineering: A special bibliography with indexes, supplement 54

This bibliography lists 316 reports, articles, and other documents introduced into the NASA scientific and technical information system in January 1975

Quantum metrology with nonclassical states of atomic ensembles

Quantum technologies exploit entanglement to revolutionize computing, measurements, and communications. This has stimulated the research in different areas of physics to engineer and manipulate fragile many-particle entangled states. Progress has been particularly rapid for atoms. Thanks to the large and tunable nonlinearities and the well developed techniques for trapping, controlling and counting, many groundbreaking experiments have demonstrated the generation of entangled states of trapped ions, cold and ultracold gases of neutral atoms. Moreover, atoms can couple strongly to external forces and light fields, which makes them ideal for ultra-precise sensing and time keeping. All these factors call for generating non-classical atomic states designed for phase estimation in atomic clocks and atom interferometers, exploiting many-body entanglement to increase the sensitivity of precision measurements. The goal of this article is to review and illustrate the theory and the experiments with atomic ensembles that have demonstrated many-particle entanglement and quantum-enhanced metrology.Comment: 76 pages, 40 figures, 1 table, 603 references. Some figures bitmapped at 300 dpi to reduce file siz

Enhanced Rateless Coding and Compressive Sensing for Efficient Data/multimedia Transmission and Storage in Ad-hoc and Sensor Networks

In this dissertation, we investigate the theory and applications of the novel class of FEC codes called rateless or fountain codes in video transmission and wireless sensor networks (WSN). First, we investigate the rateless codes in intermediate region where the number of received encoded symbols is less that minimum required for full datablock decoding. We devise techniques to improve the input symbol recovery rate when the erasure rate is unknown, and also for the case where an estimate of the channel erasure rate is available. Further, we design unequal error protection (UEP) rateless codes for distributed data collection of data blocks of unequal lengths, where two encoders send their rateless coded output symbols to a destination through a common relay. We design such distributed rateless codes, and jointly optimize rateless coding parameters at each nodes and relaying parameters. Moreover, we investigate the performance of rateless codes with finite block length in the presence of feedback channel. We propose a smart feedback generation technique that greatly improves the performance of rateless codes when data block is finite. Moreover, we investigate the applications of UEP-rateless codes in video transmission systems. Next, we study the optimal cross-layer design of a video transmission system with rateless coding at application layer and fixed-rate coding (RCPC coding) at physical layer. Finally, we review the emerging compressive sensing (CS) techniques that have close connections to FEC coding theory, and designed an efficient data storage algorithm for WSNs employing CS referred to by CStorage. First, we propose to employ probabilistic broadcasting (PB) to form one CS measurement at each node and design CStorage- P. Later, we can query any arbitrary small subset of nodes and recover all sensors reading. Next, we design a novel parameterless and more efficient data dissemination algorithm that uses two-hop neighbor information referred to alternating branches (AB).We replace PB with AB and design CStorage-B, which results in a lower number of transmissions compared to CStorage-P.Electrical Engineerin

NASA Tech Briefs, July 1990

Topics include: New Product Ideas; NASA TU Services; Electronic Components and Circuits; Electronic Systems; Physical Sciences; Materials; Computer Programs; Mechanics; Machinery; Fabrication Technology; Mathematics and Information Sciences; Life Sciences