Three techniques are presented for handling cyclic circuits in a compiled unit-delay simulation. These techniques are based on the PC-set Method and the Parallel Technique of compiled unit-delay simulation. The first technique, called the Synchronous Parallel Technique, is applicable only to synchronous circuits, but provides significant performance improvements over interpreted unit-delay simu...

We present a generic framework for parallel coordinate descent (CD) algorithms that includes, as special cases, the original sequential algorithms Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm. We introduce two novel parallel algorithms that are also special cases—Thread-Greedy CD and ColoringBased CD—and give performance measurements for an OpenMP implementation...

A parallel fast direct solver based on the Divide & Conquer method is considered for linear systems with separable block tridiagonal matrices. Such systems are obtained, for example, by discretizing the two{dimensional Poisson equation posed on rectangular domains with the continuous piecewise linear nite elements on nonuniform triangulated rectangular meshes. The Divide & Conquer method has th...

There are many cyclic peptides with diverse biological activities, such as antibacterial activity, immunosuppressive activity, and anti-tumor activity, and so on. Encouraged by natural cyclic peptides with biological activity, efforts have been made to develop cyclic peptides with both genetic and synthetic methods. The genetic methods include phage display, intein-based cyclic peptides, and mR...

Novel recursive formulations of Block Pseudocirculant Matrices, which are reordered using stride permutations, lead to fully structured higher order Block Pseudocirculants, termed Super Block Pseudocirculant Matrices. These matrices provide a unified framework to develop highly modular parallel cyclic convolution architectures as well as to develop reduced complexity parallel FIR filtering cons...

We present a new parallel radix-4 FFT algorithm based on the BSP model. Our parallel algorithm uses the group-cyclic distribution family, which makes it simple to understand and easy to implement. We show how to reduce the communication cost of the algorithm by a factor of three, in the case that the input/output vector is in the cyclic distribution. We also show how to reduce computation time ...

Row-cyclic array codes equipped with m-metric [13] suitable for parallel channel communication systems have been introduced by the first author in [10] and the notion of cluster/burst array errors were introduced by the first author in [6]. In this paper, we study cluster array errors detection and correction in row-cyclic array codes.