Block Synchronization Research Articles

Performance Limits Study of Stencil Codes on Modern GPGPUs

We study the performance limits of different algorithmic approaches to the implementation of a sample problem of wave equation solution with a cross stencil scheme. With this, we aim to find the highest limit of the achievable performance efficiency for stencil computing. To estimate the limits, we use a quantitative Roofline model to make a thorough analysis of the performance bottlenecks and develop the model further to account for the latency of different levels of GPU memory. These estimates provide an incentive to use spatial and temporal blocking algorithms. Thus, we study stepwise, domain decomposition, and domain decomposition with halo algorithms in that order. The knowledge of the limit incites the motivation to optimize the implementation. This led to the analysis of the block synchronization methods in CUDA, which is also provided in the text. After all optimizations, we have achieved 90% of the peak performance, which amounts to more than 1 trillion cell updates per second on one consumer level GPU device.

Quantum Synchronizable Codes From the Cyclotomy of Order Four

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes (QECCs) that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct two classes of QSCs from the cyclic codes which are obtained by the cyclotomic classes of order four. The QSCs constructed are Calderbank–Shor–Steane QECCs which can tolerate maximum number of misalignment errors. Moreover, the QSCs usually possess good error-correcting capability towards bit error and phase error, due to many cyclic codes employed to construct QSCs are optimal or almost optimal.

Near Optimal Timing and Frequency Offset Estimation for 5G Integrated LEO Satellite Communication System

The integration of satellite and terrestrial 5G networks aims to provide ubiquitous coverage, improve service reliability, and enable the network scalability. However, the inherent characteristics of satellite channels bring challenges on the air interface design of integrated terrestrial-satellite networks. For example, for low earth orbits (LEO) mobile satellite communication (SatCom) system, it is unclear so far whether the 5G new radio (5G-NR) synchronization signals could meet the requirement of timing and frequency offset estimation in the presence of large Doppler shifts. In this paper, we investigate time and frequency synchronization for the downlink transmission of 5G-NR signals over LEO satellite channels. Starting from the maximum log-likelihood criterion for timing offset estimation given the observation of the received primary synchronization signals (PSS), we derive an upper bound of the objective function for simplicity. With a priori information that the maximum Doppler shift of LEO satellite-ground link is within a specific range, we construct the local synchronization sequence via using the modulated discrete prolate spheroidal sequences (DPSS) vectors. Then the timing offset estimation can be recast into a one-dimensional peak search problem. Moreover, the cyclic prefix (CP) structure of orthogonal frequency division multiplexing (OFDM) can be utilized to improve the estimation performance further. Once the timing and frequency offset are captured in the above initial synchronization phase, the tracking synchronization can be much simplified as the variation of both the timing and frequency offset is very small between two adjacent synchronization blocks. Simulation results show that by using the proposed algorithms, the 5G-NR signals can achieve near optimal downlink time and frequency synchronization in typical LEO SatCom systems.

Specification and verification of synchronization with condition variables

This paper proposes a technique to specify and verify the correct synchronization of concurrent programs with condition variables. We define correctness of synchronization as the liveness property: “every thread synchronizing under a set of condition variables eventually exits the synchronization block”, under the assumption that every such thread eventually reaches its synchronization block. Our technique does not avoid the combinatorial explosion of interleavings of thread behaviours. Instead, we alleviate it by abstracting away all details that are irrelevant to the synchronization behaviour of the program, which is typically significantly smaller than its overall behaviour. First, we introduce SyncTask, a simple imperative language to specify parallel computations that synchronize via condition variables. We consider a SyncTask program to have a correct synchronization iff it terminates. Further, to relieve the programmer from the burden of providing specifications in SyncTask, we introduce an economic annotation scheme for Java programs to assist the automated extraction of SyncTask programs capturing the synchronization behaviour of the underlying program. We show that every Java program annotated according to the scheme (and satisfying the assumption mentioned above) has a correct synchronization iff its corresponding SyncTask program terminates. We then show how to transform the verification of termination of the SyncTask program into a standard reachability problem over Coloured Petri Nets that is efficiently solvable by existing Petri Net analysis tools. Both the SyncTask program extraction and the generation of Petri Nets are implemented in our STaVe tool. We evaluate the proposed framework on a number of test cases. • A methodology to model programs with condition variables is introduced. • A synchronization annotation language for Java programs is proposed. • An automated extraction of synchronization models is realised. • The synchronization correctness problem for such models can be solved efficiently.

A Novel Residual Frequency Estimation Method for GNSS Receivers.

In Global Navigation Satellite System (GNSS) receivers, residual frequency estimation methods are traditionally applied in the synchronization block to reduce the transient time from acquisition to tracking, or they are used within the frequency estimator to improve its accuracy in open-loop architectures. There are several disadvantages in the current estimation methods, including sensitivity to noise and wide search space size. This paper proposes a new residual frequency estimation method depending on differential processing. Although the complexity of the proposed method is higher than the one of traditional methods, it can lead to more accurate estimates, without increasing the size of the search space.

Deterministic Communication in Radio Networks

In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcasting and wake-up. We consider an unknown radio network, in which all nodes have no prior knowledge about network topology, and know only the size of the network $n$, the maximum in-degree of any node $\Delta$, and the eccentricity of the network $D$. For such networks, we first give an algorithm for wake-up, based on the existence of small universal synchronizers. This algorithm runs in $O(\frac{\min\{n, D \Delta\} \log n \log \Delta}{\log\log \Delta})$ time, the fastest known in both directed and undirected networks, improving over the previous best $O(n \log^2n)$-time result across all ranges of parameters, but particularly when maximum in-degree is small. Next, we introduce a new combinatorial framework of block synchronizers and prove the existence of such objects of low size. Using this framework, we design a new deterministic algorithm for the fundamental problem of broadcasting, running in $O(n \log D \log\log\frac{D \Delta}{n})$ time. This is the fastest known algorithm for the problem in directed networks, improving upon the $O(n \log n \log \log n)$-time algorithm of De Marco (2010) and the $O(n \log^2 D)$-time algorithm due to Czumaj and Rytter (2003). It is also the first to come within a log-logarithmic factor of the $\Omega(n \log D)$ lower bound due to Clementi et al.\ (2003). Our results also have direct implications on the fastest \emph{deterministic leader election} and \emph{clock synchronization} algorithms in both directed and undirected radio networks, tasks which are commonly used as building blocks for more complex procedures.

Improved single-phase PLL structure with DC-SOGI block on FPGA board implementation

Synchronization block which is used as a part of photovoltaic (PV) inverters control structure has a key impact on connectinginverters with grid. One of the most important parameters in the point of connection PV inverter and grid is phase angle between gridvoltage and inverter current. This angle determines the energy transfer between inverter and grid. Synchronization algorithms havedeveloped for very long time. At first, they were based on zero crossing grid voltage detection, while today complexed synchronizationalgorithms implemented on high performance digital board have been used. One of these synchronization structures is Phase LockedLoop – PLL. In this paper implementation of improved PLL structure is presented. This improved structure is special while it haspossibility of grid parameters estimation even if grid voltage has noise or DC offset. This DC offset from the grid in PLL structureusually entered via measurement and A/D conversion processor or may be generated due to temporary system faults. Appearance ofDC offset in measured grid voltage on the one hand prevents any estimation process of grid parameters and on the other hand alsodegrades reference sine signal at the output of PLL structure in PV inverters. This improved structure is designed in digital form andimplemented on FPGA digital board and experimental results of this implementation are presented. Obtained experimental resultsshow that the proposed PLL structure successfully solves important issue such is presence of DC offset in measured grid voltage.

Change propagation and bidirectionality in internal transformation DSLs

Despite good results in several industrial projects, model-driven engineering (MDE) has not been widely adopted in industry. Although MDE has existed for more than a decade now, the lack of tool support is still one of the major problems, according to studies by Staron and Mohaghegi (Staron, in: Model driven engineering languages and systems, Springer, Berlin, 2006; Mohagheghi et al. in Empir Softw Eng 18(1):89–116, 2013). Internal languages offer a solution to this problem for model transformations, which are a key part of MDE. Developers can use existing tools of host languages to create model transformations in a familiar environment. These internal languages, however, typically lack key features such as change propagation or bidirectional transformations. In our opinion, one reason is that existing formalisms for these properties are not well suited for textual languages. In this paper, we present a new formalism describing incremental, bidirectional model synchronizations using synchronization blocks. We prove the ability of this formalism to detect and repair inconsistencies and show its hippocraticness. We use this formalism to create a single internal model transformation language for unidirectional and bidirectional model transformations with optional change propagation. In total, we currently provide 18 operation modes based on a single specification. At the same time, the language may reuse tool support for C#. We validate the applicability of our language using a synthetic example with a transformation from finite state machines to Petri nets where we achieved speedups of up to multiple orders of magnitude compared to classical batch transformations.

On the Identification of SM and Alamouti-Coded SC-FDMA Signals: A Statistical-Based Approach

Signal identification represents the task of a receiver to identify the signal type and its parameters, with applications to both military and commercial communications. In this paper, we investigate the identification of spatial multiplexing (SM) and Alamouti (AL) space-time block code (STBC) with single carrier frequency division multiple access (SC-FDMA) signals, when the receiver is equipped with a single antenna. We develop a discriminating feature based on a fourth-order statistic of the received signal, as well as a constant false alarm rate decision criterion which relies on the statistical properties of the feature estimate. Furthermore, we present the theoretical performance analysis of the proposed identification algorithm. The algorithm does not require channel or noise power estimation, modulation classification, and block synchronization. Simulation results show the validity of the proposed algorithm, as well as a very good agreement with the theoretical analysis.

Increasing the noise immunity of signal processing units of telecommunications on the basis of the modified synchronization schemes

The paper presents mathematical models formalizing analytical description of the synthesis filters polyphasic device synchronization signal processing blocks of telecommunications. A device synchronization of telecommunications using polyphasic and polyphase filters. The peculiarity of these schemes is that they contain only three multiplications. It was determined that the fractional change speeds when interpolation and decimation factors are low enough effective filters polyphasic interpolators Farrow, who can effectively arbitrary (irrational) resampling. A simulation scheme of information transmission channel using polyphase interpolation solutions. It is shown that this approach allows for structural synthesis device clock synchronization, enhance immunity signal processing blocks and get the advantage of the modified scheme for a given level of probability of bit errors. Experimentally, the use of cubic Lagrange interpolators in the circuit block synchronization signal processing with 16QAM (experimental conditions) allows you to gain at 1.4 dB for BER = 10-4, modified interpolation scheme and agreed multiphase filtering scheme allow you to gain at 3 dB for BER = 10-4 and modified interpolation device at 3.4 dB Performance interpolation device primarily for high values .

Blind Identification of SM and Alamouti STBC-OFDM Signals

This paper proposes an efficient identification algorithm for spatial multiplexing (SM) and Alamouti (AL) coded orthogonal frequency division multiplexing (OFDM) signals. The cross-correlation between the received signals from different antennas is exploited to provide a discriminating feature to identify SM-OFDM and AL-OFDM signals. The proposed algorithm requires neither estimation of the channel coefficients and noise power, nor the modulation of the transmitted signal. Moreover, it does not need space-time block code (STBC) or OFDM block synchronization. The effectiveness of the proposed algorithm is demonstrated through extensive simulation experiments in the presence of diverse transmission impairments, such as time and frequency offsets, Doppler frequency, and spatially correlated fading.

Quantum Synchronizable Codes From Finite Geometries

Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic $2$, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.

Noise‐based spreading in code division multiple access systems for secure communications

SUMMARYBinary spreading sequences or chaotic nonbinary sequences are used in code division multiple access systems. In contrast to those sequences, this paper presents the theory, simulation, and implementation in digital signal processor technology of a code division multiple access system that uses random spreading sequences. The expressions for probability of bit error are derived for the cases when the additive white Gaussian noise and fading are present in the channel. Because the overall transmitted signal is a sum of random signals, the security of signal transmission in this communication system can be enormously increased and will depend on the goodness of the random sequence generator. The developed theory was confirmed by a prototype of the system that was designed in digital signal processor technology. The prototype used spreading sequences that had statistical characteristics very close to the characteristics of theoretical random sequences. The main problem in the system is how to synchronize the received spread sequence with the locally generated sequence. Hence, a mathematical model of the synchronization block for the system has been separately designed and developed. The synchronization procedure has been demonstrated on the basis of application of a periodically repeated pilot sequence. Copyright © 2014 John Wiley & Sons, Ltd.

Parsing a Sequence of Qubits

We develop a theoretical framework for frame synchronization, also known as block synchronization, in the quantum domain which makes it possible to attach classical and quantum metadata to quantum information over a noisy channel even when the information source and sink are frame-wise asynchronous. This eliminates the need of frame synchronization at the hardware level and allows for parsing qubit sequences during quantum information processing. Our framework exploits binary constant-weight codes that are self-synchronizing. Possible applications may include asynchronous quantum communication such as a self-synchronizing quantum network where one can hop into the channel at any time, catch the next coming quantum information with a label indicating the sender, and reply by routing her quantum information with control qubits for quantum switches all without assuming prior frame synchronization between users.

Algebraic techniques in designing quantum synchronizable codes

Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the known general framework for designing quantum synchronizable codes through more extensive use of the theory of finite fields. This makes it possible to widen the range of tolerable magnitude of block synchronization errors while giving mathematical insight into the algebraic mechanism of synchronization recovery. Also given are families of quantum synchronizable codes based on punctured Reed-Muller codes and their ambient spaces.

Method of forecasting energy center positions of laser beam spot images using a parallel hierarchical network for optical communication systems

A forecasting method, based on the parallel-hierarchical (PH) network and hyperbolic smoothing of empirical data, is presented in this paper. Preceding values of the time series, hyperbolic smoothing, and PH network data are used for forecasting. To determine a position of the next route fragment in relation to X and Y axes, hyperbola parameters are sent to the route parameter forecasting system. In the results synchronization block, network-processed data arrive to the database where a sample of most correlated data is drawn using service parameters of the PH network. An average prediction error is 0.55% for the developed method and 1.62% for neural networks. That is why, due to the use of the PH network and hyperbolic smoothing, the developed method is more efficient for real-time systems than traditional neural networks in forecasting energy center positions of laser beam spot images for optical communication systems.

Nkd2, a negative regulator of Wnt pathway, delays mitotic exit in Hela cell

Frequent amplification and abundant expression of Nkd2 has been identified in malignant peripheral nerve sheath tumors (MPNSTs), dominant for genomic instability, who is involved in both Wnt pathway and EGFR signaling pathway. As a negative regulator of Wnt pathway, Nkd2 suppresses Wnt signaling by binding to Dvl1 and causing its ubiquitination followed by 26S proteasome degradation. On the other hand, it interacts with TGF-α for its transportation to basolateral plasma membrane in polarized epithelial cells. It is of interest to determine if Nkd2 over-expression contributes to tumorigenesis and genomic instablity. In this paper, we found that cells expressing NKD2 delayed mitotic exit stage after double thymidine block synchronization, but aneuploidy was not detected in these cells. This was further confirmed by Western blotting. In nocodazole-synchronised cells, Cyclin B1 degradation was delayed with Nkd2 over-expression compared to control group. Given many previous publications showed that Wnt pathway components are involved in mitotic progression. Further investigation on Nkd2’s function in mitosis might give more clues on MPNSTs pathological progression.

Improved synchronization, channel estimation, and simplified LDPC decoding for the physical layer of the DVB-T2 receiver

The newly developed 2nd generation standard for digital video broadcasting (DVB-T2) emerges as a significant upgrade over its first generation predecessor DVB-T. The DVB-T2 standard targets an increased system throughput by at least 30% over the DVB-T. This article introduces algorithms in the signal processing chain to improve the mobile operation for DVB-T2. The proposed modified synchronization blocks, along with the improved channel estimation, show significant improvement compared to the results reported in the DVB-T2 implementation guide. In addition, state-of-the-art low-complexity algorithms in the bit processing chain, particularly in the LDPC decoder, are used to provide robustness and support throughput increase, while reducing the implementation complexity. The integrated system is simulated including implementation effects. The simulation results confirm the enhanced performance of the developed integrated model and provide better results compared to those reported in literature.

Block synchronization for quantum information

Locating the boundaries of consecutive blocks of quantum information is a fundamental building block for advanced quantum computation and quantum communication systems. We develop a coding theoretic method for properly locating boundaries of quantum information without relying on external synchronization when block synchronization is lost. The method also protects qubits from decoherence in a manner similar to conventional quantum error-correcting codes, seamlessly achieving synchronization recovery and error correction. A family of quantum codes that are simultaneously synchronizable and error-correcting is given through this approach.

LC/DC: Lockless Containers and Data Concurrency a Novel Nonblocking Container Library for Multicore Applications

Exploiting the parallelism in multiprocessor systems is a major challenge in modern computer science. Multicore programming demands a change in the way we design and use fundamental data structures. The standard collection of data structures and algorithms in C++11 is the sequential standard template library (STL). In this paper, we present their vision for the theory and practice for the design and implementation of a collection of highly concurrent fundamental data structures for multiprocessor application development with associated programming interface and advanced optimization support. Specifically, the proposed approach will provide a familiar, easy-to-use, and composable interface, similar to that of C++ STL. Each container type will be enhanced with internal support for nonblocking synchronization of its data access, thereby providing better safety and performance than traditional blocking synchronization by: 1) eliminating hazards such as deadlock, livelock, and priority inversion and 2) by being highly scalable in supporting large numbers of threads. The new library, lockless containers/data concurrency, will provide algorithms for handling fundamental computations in multithreaded contexts, and will incorporate these into libraries with familiar look and feel. The proposed approach will provide an immense boost in performance and software reuse, consequently productivity, for developers of scientific and systems applications, which are predominantly in C/C++. STL is widely used and a concurrent replacement library will have an immediate practical relevance and a significant impact on a variety of parallel programming domains including simulation, massive data mining, computational biology, financial engineering, and embedded control systems. As a proof-of-concept, this paper discusses the first design and implementation of a wait-free hash table.