1,258 research outputs found
Survey of Inter-satellite Communication for Small Satellite Systems: Physical Layer to Network Layer View
Small satellite systems enable whole new class of missions for navigation,
communications, remote sensing and scientific research for both civilian and
military purposes. As individual spacecraft are limited by the size, mass and
power constraints, mass-produced small satellites in large constellations or
clusters could be useful in many science missions such as gravity mapping,
tracking of forest fires, finding water resources, etc. Constellation of
satellites provide improved spatial and temporal resolution of the target.
Small satellite constellations contribute innovative applications by replacing
a single asset with several very capable spacecraft which opens the door to new
applications. With increasing levels of autonomy, there will be a need for
remote communication networks to enable communication between spacecraft. These
space based networks will need to configure and maintain dynamic routes, manage
intermediate nodes, and reconfigure themselves to achieve mission objectives.
Hence, inter-satellite communication is a key aspect when satellites fly in
formation. In this paper, we present the various researches being conducted in
the small satellite community for implementing inter-satellite communications
based on the Open System Interconnection (OSI) model. This paper also reviews
the various design parameters applicable to the first three layers of the OSI
model, i.e., physical, data link and network layer. Based on the survey, we
also present a comprehensive list of design parameters useful for achieving
inter-satellite communications for multiple small satellite missions. Specific
topics include proposed solutions for some of the challenges faced by small
satellite systems, enabling operations using a network of small satellites, and
some examples of small satellite missions involving formation flying aspects.Comment: 51 pages, 21 Figures, 11 Tables, accepted in IEEE Communications
Surveys and Tutorial
List Decoding of Arikan's PAC Codes
Polar coding gives rise to the first explicit family of codes that provably
achieve capacity with efficient encoding and decoding for a wide range of
channels. However, its performance at short block lengths is far from optimal.
Arikan has recently presented a new polar coding scheme, which he called
polarization-adjusted convolutional (PAC) codes. Such PAC codes provide
dramatic improvement in performance as compared to both standard
successive-cancellation decoding as well as CRC-aided list decoding. Arikan's
PAC codes are based primarily upon the following ideas: replacing CRC precoding
with convolutional precoding (under appropriate rate profiling) and replacing
list decoding by sequential decoding. His simulations show that PAC codes,
resulting from the combination of these ideas, are close to finite-length
bounds on the performance of any code under ML decoding.
One of our main goals in this paper is to answer the following question: is
sequential decoding essential for the superior performance of PAC codes? We
show that similar performance can be achieved using list decoding when the list
size is moderately large (say, ). List decoding has distinct
advantages over sequential decoding is certain scenarios, such as low-SNR
regimes or situations where the worst-case complexity/latency is the primary
constraint. Another objective is to provide some insights into the remarkable
performance of PAC codes. We first observe that both sequential decoding and
list decoding of PAC codes closely match ML decoding thereof. We then estimate
the number of low weight codewords in PAC codes, using these estimates to
approximate the union bound on their performance under ML decoding. These
results indicate that PAC codes are superior to both polar codes and
Reed-Muller codes, and suggest that the goal of rate-profiling may be to
optimize the weight distribution at low weights.Comment: 9 pages, 10 figures, abridged version of this paper will be presented
at the International Symposium on Information Theory, June 202
Improve the Usability of Polar Codes: Code Construction, Performance Enhancement and Configurable Hardware
Error-correcting codes (ECC) have been widely used for forward error correction (FEC) in modern communication systems to dramatically reduce the signal-to-noise ratio (SNR) needed to achieve a given bit error rate (BER). Newly invented polar codes have attracted much interest because of their capacity-achieving potential, efficient encoder and decoder implementation, and flexible architecture design space.This dissertation is aimed at improving the usability of polar codes by providing a practical code design method, new approaches to improve the performance of polar code, and a configurable hardware design that adapts to various specifications.
State-of-the-art polar codes are used to achieve extremely low error rates. In this work, high-performance FPGA is used in prototyping polar decoders to catch rare-case errors for error-correcting performance verification and error analysis. To discover the polarization characteristics and error patterns of polar codes, an FPGA emulation platform for belief-propagation (BP) decoding is built by a semi-automated construction flow. The FPGA-based emulation achieves significant speedup in large-scale experiments involving trillions of data frames. The platform is a key enabler of this work.
The frozen set selection of polar codes, known as bit selection, is critical to the error-correcting performance of polar codes. A simulation-based in-order bit selection method is developed to evaluate the error rate of each bit using Monte Carlo simulations. The frozen set is selected based on the bit reliability ranking. The resulting code construction exhibits up to 1 dB coding gain with respect to the conventional bit selection.
To further improve the coding gain of BP decoder for low-error-rate applications, the decoding error mechanisms are studied and analyzed, and the errors are classified based on their distinct signatures. Error detection is enabled by low-cost CRC concatenation, and post-processing algorithms targeting at each type of the error is designed to mitigate the vast majority of the decoding errors. The post-processor incurs only a small implementation overhead, but it provides more than an order of magnitude improvement of the error-correcting performance.
The regularity of the BP decoder structure offers many hardware architecture choices. Silicon area, power consumption, throughput and latency can be traded to reach the optimal design points for practical use cases. A comprehensive design space exploration reveals several practical architectures at different design points. The scalability of each architecture is also evaluated based on the implementation candidates.
For dynamic communication channels, such as wireless channels in the upcoming 5G applications, multiple codes of different lengths and code rates are needed to t varying channel conditions. To minimize implementation cost, a universal decoder architecture is proposed to support multiple codes through hardware reuse. A 40nm length- and rate-configurable polar decoder ASIC is demonstrated to fit various
communication environments and service requirements.PHDElectrical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/140817/1/shuangsh_1.pd
Intra- and inter-metabolite correlation spectroscopy of tomato metabolomics data obtained by liquid chromatography-mass spectrometry and nuclear magnetic resonance
Nuclear magnetic resonance (NMR) and liquid chromatography-mass spectrometry (LCMS) are frequently used as technological platforms for metabolomics applications. In this study, the metabolic profiles of ripe fruits from 50 different tomato cultivars, including beef, cherry and round types, were recorded by both 1H NMR and accurate mass LC-quadrupole time-of-flight (QTOF) MS. Different analytical selectivities were found for these both profiling techniques. In fact, NMR and LCMS provided complementary data, as the metabolites detected belong to essentially different metabolic pathways. Yet, upon unsupervised multivariate analysis, both NMR and LCMS datasets revealed a clear segregation of, on the one hand, the cherry tomatoes and, on the other hand, the beef and round tomatoes. Intra-method (NMR¿NMR, LCMS¿LCMS) and inter-method (NMR¿LCMS) correlation analyses were performed enabling the annotation of metabolites from highly correlating metabolite signals. Signals belonging to the same metabolite or to chemically related metabolites are among the highest correlations found. Inter-method correlation analysis produced highly informative and complementary information for the identification of metabolites, even in de case of low abundant NMR signals. The applied approach appears to be a promising strategy in extending the analytical capacities of these metabolomics techniques with regard to the discovery and identification of biomarkers and yet unknown metabolites
A Tutorial on Coding Methods for DNA-based Molecular Communications and Storage
Exponential increase of data has motivated advances of data storage
technologies. As a promising storage media, DeoxyriboNucleic Acid (DNA) storage
provides a much higher data density and superior durability, compared with
state-of-the-art media. In this paper, we provide a tutorial on DNA storage and
its role in molecular communications. Firstly, we introduce fundamentals of
DNA-based molecular communications and storage (MCS), discussing the basic
process of performing DNA storage in MCS. Furthermore, we provide tutorials on
how conventional coding schemes that are used in wireless communications can be
applied to DNA-based MCS, along with numerical results. Finally, promising
research directions on DNA-based data storage in molecular communications are
introduced and discussed in this paper
- …