Combined permutation codes for synchronization

Abstract: A combined code is a code that combines two or more characteristics of other codes. A construction is presented in this paper of permutation codes that are self-synchronizing and able to correct a number of deletion errors per codeword, thus a combined permutation code. Synchronization errors, modelled as deletion(s) and/or insertion(s) of bits or symbols, can be catastrophic if not detected and corrected. Some classes of codes have been proposed that are synchronizable, i.e. they can be used to regain synchronization although the error leading to the loss of synchronization is not corrected. Typically, different classes of codes are needed to correct deletion and/or insertion errors after codeword boundaries have been detected. The codebooks presented in this paper consist of codewords divided into segments. By imposing restrictions on the segments, the codewords are synchronizable. One deletion error can be detected and corrected per segment

Pseudonoise (PN) synchronization of data system with derivation of clock frequency from received signal for clocking receiver PN generator

A digital communicating system for automatically synchronizing signals for data detection is described. The systems consists of biphase modulating a subcarrier frequency by the binary data and transmitting a carrier phase modulated by this signal to a receiver, where coherent phase detection is employed to recover the subcarrier. Data detection is achieved by providing, in the receiver, a demodulated reference which is in synchronism with the unmodulated subcarrier in transmitting system. The output of the detector is passed through a matched filter where the signal is integrated over a bit period. As a result, random noise components are averaged out, so that the probability of detecting the correct data transmitted is maximized

The "MIND" Scalable PIM Architecture

MIND (Memory, Intelligence, and Network Device) is an advanced parallel computer architecture for high performance computing and scalable embedded processing. It is a Processor-in-Memory (PIM) architecture integrating both DRAM bit cells and CMOS logic devices on the same silicon die. MIND is multicore with multiple memory/processor nodes on each chip and supports global shared memory across systems of MIND components. MIND is distinguished from other PIM architectures in that it incorporates mechanisms for efficient support of a global parallel execution model based on the semantics of message-driven multithreaded split-transaction processing. MIND is designed to operate either in conjunction with other conventional microprocessors or in standalone arrays of like devices. It also incorporates mechanisms for fault tolerance, real time execution, and active power management. This paper describes the major elements and operational methods of the MIND architecture

A Parallel Adaptive P3M code with Hierarchical Particle Reordering

We discuss the design and implementation of HYDRA_OMP a parallel implementation of the Smoothed Particle Hydrodynamics-Adaptive P3M (SPH-AP3M) code HYDRA. The code is designed primarily for conducting cosmological hydrodynamic simulations and is written in Fortran77+OpenMP. A number of optimizations for RISC processors and SMP-NUMA architectures have been implemented, the most important optimization being hierarchical reordering of particles within chaining cells, which greatly improves data locality thereby removing the cache misses typically associated with linked lists. Parallel scaling is good, with a minimum parallel scaling of 73% achieved on 32 nodes for a variety of modern SMP architectures. We give performance data in terms of the number of particle updates per second, which is a more useful performance metric than raw MFlops. A basic version of the code will be made available to the community in the near future.Comment: 34 pages, 12 figures, accepted for publication in Computer Physics Communication

Working memory revived in older adults by synchronizing rhythmic brain circuits

Published in final edited form as: Nat Neurosci. 2019 May ; 22(5): 820–827. doi:10.1038/s41593-019-0371-x.Understanding normal brain aging and developing methods to maintain or improve cognition in older adults are major goals of fundamental and translational neuroscience. Here we show a core feature of cognitive decline—working-memory deficits—emerges from disconnected local and long-range circuits instantiated by theta–gamma phase–amplitude coupling in temporal cortex and theta phase synchronization across frontotemporal cortex. We developed a noninvasive stimulation procedure for modulating long-range theta interactions in adults aged 60–76 years. After 25 min of stimulation, frequency-tuned to individual brain network dynamics, we observed a preferential increase in neural synchronization patterns and the return of sender–receiver relationships of information flow within and between frontotemporal regions. The end result was rapid improvement in working-memory performance that outlasted a 50 min post-stimulation period. The results provide insight into the physiological foundations of age-related cognitive impairment and contribute to groundwork for future non-pharmacological interventions targeting aspects of cognitive decline.Accepted manuscrip

Computer-aided programming for multiprocessing systems

As both the number of processors and the complexity of problems to be solved increase, programming multiprocessing systems becomes more difficult and error-prone. This report discusses parallel models of computation and tools for computer-aided programming (CAP). Program development tools are necessary since programmers are not able to develop complex parallel programs efficiently. In particular, a CAP tool, named Hypertool, is described here. It performs scheduling and handles the communication primitive insertion automatically so that many errors are eliminated. It also generates the performance estimates and other program quality measures to help programmers in improving their algorithms and programs. Experiments have shown that up to a 300% performance improvement can be achieved by computer-aided programming

Ordered Measurements of Permutationally-Symmetric Qubit Strings

We show that any sequence of measurements on a permutationally-symmetric (pure or mixed) multi-qubit string leaves the unmeasured qubit substring also permutationally-symmetric. In addition, we show that the measurement probabilities for an arbitrary sequence of single-qubit measurements are independent of how many unmeasured qubits have been lost prior to the measurement. Our results are valuable for quantum information processing of indistinguishable particles by post-selection, e.g. in cases where the results of an experiment are discarded conditioned upon the occurrence of a given event such as particle loss. Furthermore, our results are important for the design of adaptive-measurement strategies, e.g. a series of measurements where for each measurement instance, the measurement basis is chosen depending on prior measurement results.Comment: 13 page