Unambiguous BPSK-like CSC Method for Galileo Acquisition

Galileo will be Europe’s own Global Navigation Satellite System (GNSS), which is aiming to provide highly accurate and guaranteed positioning services. Galileo E1 system has a code period of 4ms which is quadruple that of GPS C/A code. In other words, due to the large number of hypotheses in code phase at acquisition stage, a longer searching time or more hardware resource is required. It is difficult to acquire Galileo signal because of longer code length and the multiple peaks of autocorrelation function of BOC modulation. In this paper, the cyclically shift-and-combine (CSC) and BPSK-like architectures are employed to resolve the unambiguous acquisition for BOC modulation and acquires these satellite signals with hardware complexity reduction. The concept of CSC code is to modify the code structure and shorten the code period such that the acquisition burden can be decreased. Simulation results show that our proposed search algorithm can provide better performances in terms of low hardware complexity for acquiring these satellite signals and detection probability at the low value of CNR.

Adaptive ratchets and the evolution of molecular complexity

Biological systems have evolved to amazingly complex states, yet we do not understand in general how evolution operates to generate increasing genetic and functional complexity. Molecular recognition sites are short genome segments or peptides binding a cognate recognition target of sufficient sequence similarity. Such sites are simple, ubiquitous modules of sequence information, cellular function, and evolution. Here we show that recognition sites, if coupled to a time-dependent target, can rapidly evolve to complex states with larger code length and smaller coding density than sites recognising a static target. The underlying fitness model contains selection for recognition, which depends on the sequence similarity between site and target, and a uniform cost per unit of code length. Site sequences are shown to evolve in a specific adaptive ratchet, which produces selection of different strength for code extensions and compressions. Ratchet evolution increases the adaptive width of evolved sites, accelerating the adaptation to moving targets and facilitating refinement and innovation of recognition functions. We apply these results to the recognition of fast-evolving antigens by the human immune system. Our analysis shows how molecular complexity can evolve as a collateral to selection for function in a dynamic environment.

Research on LDPC in an OFDM System

In this paper, LDPC codes and OFDM technologies are studied, and combines LDPC and OFDM to simulate and verify the performance. The encoding of LDPC and logarithmic domain BP decoding algorithm and the principle of OFDM are introduced. Through MATLAB, the simulation of OFDM-LDPC system in different channel, different code length, different iteration times, LDPC and OFDM-LDPC in the same conditions are compared. Through simulation analysis, we can know that the performance of OFDM-LDPC system will improve with the increase of the code length. When the SNR is small, the number of iterations has little effect on the performance of OFDM-LDPC system. When the SNR is large, the performance of the system will be improved with the increase of the number of iterations. The performance of OFDM-LDPC codes is better than that of LDPC codes. The performance of OFDM-LDPC code is better than LDPC code in multipath Rayleigh fading channel.

Behavior study of EDEU optical code for FE-OCDMA system

The increase in the cardinality of the frequency encoding-optical code division multiple access (OCDMA) system directly affects the length of the optical code, which leads us to find a less expensive solution. In this work, I propose an improved version of the diagonal eigenvalue Unit code (DEU) called Enhanced diagonal eigenvalue Unit code (EDEU) that is much easier in terms of construction and short in code length compared to the DEU code. The results found showed that the performance of the EDEU code exceeds the DEU code in terms of bit error rate (BER), and allowed us to multiplex about 15 more users when using the EDEU code compared to the system using the DEU code. As a result, the EDEU code is very suitable for use in access and OCDMA systems and it can be seen as a strong competitor to existing codes.

Low-Latency QC-LDPC Encoder Design for 5G NR

In order to meet the low latency and high throughput requirements of data transmission in 5th generation (5G) New Radio (NR), it is necessary to minimize the low power encoding hardware latency on transmitter and achieve lower base station power consumption within a fixed transmission time interval (TTI). This paper investigates parallel design and implementation of 5G quasi-cyclic low-density parity-check (QC-LDPC) codes encoder. The designed QC-LDPC encoder employs a multi-channel parallel structure to obtain multiple parity check bits and thus reduce encoding latency significantly. The proposed encoder maps high parallelism encoding algorithms to a configurable circuit architecture, achieving flexibility and support for all 5G NR code length and code rate. The experimental results show that under the 800 MHz system frequency, the achieved data throughput ranges from 62 to 257.9 Gbps, and the maximum code length encoding time under base graph 1 (BG1) is only 33.75 ns, which is the critical encoding time of our proposed encoder. Finally, our proposed encoder was synthesized on SMIC 28 nm CMOS technology; the result confirmed the effectiveness and feasibility of our design.

Robust unified Granger causality analysis: a normalized maximum likelihood form

Unified Granger causality analysis (uGCA) alters conventional two-stage Granger causality analysis into a unified code-length guided framework. We have presented several forms of uGCA methods to investigate causal connectivities, and different forms of uGCA have their own characteristics, which capable of approaching the ground truth networks well in their suitable contexts. In this paper, we considered comparing these several forms of uGCA in detail, then recommend a relatively more robust uGCA method among them, uGCA-NML, to reply to more general scenarios. Then, we clarified the distinguished advantages of uGCA-NML in a synthetic 6-node network. Moreover, uGCA-NML presented its good robustness in mental arithmetic experiments, which identified a stable similarity among causal networks under visual/auditory stimulus. Whereas, due to its commendable stability and accuracy, uGCA-NML will be a prior choice in this unified causal investigation paradigm.

Blockchain Processing Technique Based on Multiple Hash Chains for Minimizing Integrity Errors of IoT Data in Cloud Environments

As IoT (Internet of Things) devices are diversified in the fields of use (manufacturing, health, medical, energy, home, automobile, transportation, etc.), it is becoming important to analyze and process data sent and received from IoT devices connected to the Internet. Data collected from IoT devices is highly dependent on secure storage in databases located in cloud environments. However, storing directly in a database located in a cloud environment makes it not only difficult to directly control IoT data, but also does not guarantee the integrity of IoT data due to a number of hazards (error and error handling, security attacks, etc.) that can arise from natural disasters and management neglect. In this paper, we propose an optimized hash processing technique that enables hierarchical distributed processing with an n-bit-size blockchain to minimize the loss of data generated from IoT devices deployed in distributed cloud environments. The proposed technique minimizes IoT data integrity errors as well as strengthening the role of intermediate media acting as gateways by interactively authenticating blockchains of n bits into n + 1 and n − 1 layers to normally validate IoT data sent and received from IoT data integrity errors. In particular, the proposed technique ensures the reliability of IoT information by validating hash values of IoT data in the process of storing index information of IoT data distributed in different locations in a blockchain in order to maintain the integrity of the data. Furthermore, the proposed technique ensures the linkage of IoT data by allowing minimal errors in the collected IoT data while simultaneously grouping their linkage information, thus optimizing the load balance after hash processing. In performance evaluation, the proposed technique reduced IoT data processing time by an average of 2.54 times. Blockchain generation time improved on average by 17.3% when linking IoT data. The asymmetric storage efficiency of IoT data according to hash code length is improved by 6.9% on average over existing techniques. Asymmetric storage speed according to the hash code length of the IoT data block was shown to be 10.3% faster on average than existing techniques. Integrity accuracy of IoT data is improved by 18.3% on average over existing techniques.

Linguistic laws are not the law in chimpanzee sexual solicitation gestures.

Two language laws have been identified as manifestations of universal principles of animal behaviour, both acting on the organisation of numerous vocal and behavioural communicative systems. Zipf's law of brevity describes a negative relationship between behavioural length and frequency of behaviour. Menzerath's law defines a negative correlation between the number of behaviours in a sequence and average length of the behaviour composing it. Both laws have been linked with the information-theoretic principle of compression, which tends to minimise code length. We investigate the presence of these two laws in the repertoire of chimpanzee sexual solicitation gestures. We find that chimpanzee solicitation gestures do not follow either Zipf's law of brevity or Menzerath's law consistently. For the second time in ape gestural communication, evidence supporting Zipf's law of brevity was absent, and, here, the presence of Menzerath's law appears individually driven. Ape gesture does not appear to manifest a principle of compression or pressure for efficiency that has been previously proposed to be universal. Importantly, the same signals were shown to adhere to these laws when used in a different behavioural context; highlighting that signallers consider signalling efficiency broadly, and diverse factors play important roles in shaping investment in signal production.